Image decoding method, image coding method, image decoding apparatus, image coding apparatus, and image coding and decoding apparatus

ABSTRACT

An image decoding method for decoding a bitstream including a coded signal resulting from coding tiles and slices into which an image is partitioned, the method including decoding the coded signal, wherein each of the slices is either a normal slice having, in a header, information used for an other slice or a dependent slice which is decoded using information included in a slice header of another slice, and when the normal slice starts from a position other than a beginning of a first tile, a second tile coded next to the first tile does not start from the dependent slice.

CROSS REFERENCE TO RELATED APPLICATIONS

This is a continuation of application Ser. No. 14/682,298, filed Apr. 9,2015, which is a continuation of application Ser. No. 14/031,169, filedSep. 19, 2013, now U.S. Pat. No. 9,036,697, which claims the benefit ofU.S. Provisional Patent Application No. 61/705,891 filed on Sep. 26,2012. The entire disclosures of the above-identified applications,including the specifications, drawings and claims, are incorporatedherein by reference in their entirety.

FIELD

One or more exemplary embodiments disclosed herein relate generally toan image coding method and an image decoding method.

BACKGROUND

At present, the majority of standardized video coding algorithms arebased on hybrid video coding. Hybrid video coding methods typicallycombine several different lossless and lossy compression schemes inorder to achieve the desired compression gain. The hybrid video codingis also the basis for ITU-T standards (H.26x standards such as H.261 andH.263) as well as ISO/IEC standards (MPEG-X standards such as MPEG-1,MPEG-2, and MPEG-4).

The most recent and advanced video coding standard is currently thestandard denoted as H.264/MPEG-4 advanced video coding (AVC) which is aresult of standardization efforts by Joint Video Team (JVT), a jointteam of ITU-T and ISO/IEC MPEG groups.

A video coding standard referred to as High-Efficiency Video Coding(HEVC) is also currently examined by Joint Collaborative Team on VideoCoding (JCT-VC) with the purpose of improving efficiency regarding thehigh-resolution video coding.

CITATION LIST Non Patent Literature

Non Patent Literature 1: “Wavefront Parallel Processing for HEVCEncoding and Decoding” by C. Gordon et al., no. JCTVC-F274-v2, from theMeeting in Torino, July 2011

Non Patent Literature 2: “Tiles” by A. Fuldseth et al., no.JCTVC-F355-v1, from the Meeting in Torino, July 2011

Non Patent Literature 3: JCTVC-J1003_d7, “High efficiency video coding(HEVC) text specification draft 8” of July 2012

SUMMARY Technical Problem

There is a desire for improving, in image coding methods and imagedecoding methods, efficiency in a situation where both parallel tileprocessing and dependent slices are used.

One non-limiting and exemplary embodiment provides an image codingmethod and an image decoding method which make it possible to improvethe efficiency when the both parallel tile processing and dependentslices are used.

Solution to Problem

In one general aspect, an image decoding method for decoding a bitstreamincluding a coded signal resulting from coding tiles and slices intowhich an image is partitioned, the method comprising decoding the codedsignal, wherein each of the slices is either a normal slice having, in aheader, information used for an other slice or a dependent slice whichis decoded using information included in a slice header of anotherslice, and when the normal slice starts from a position other than abeginning of a first tile, a second tile coded next to the first tiledoes not start from the dependent slice.

These general and specific aspects may be implemented using a system, amethod, an integrated circuit, a computer program, or acomputer-readable recording medium such as a CD-ROM, or any combinationof systems, methods, integrated circuits, computer programs, orcomputer-readable recording media.

Advantageous Effects

One or more exemplary embodiments or features disclosed herein providean image coding method and an image decoding method which make itpossible to improve efficiency when both parallel tile processing anddependent slices are used.

BRIEF DESCRIPTION OF DRAWINGS

These and other objects, advantages and features of the invention willbecome apparent from the following description thereof taken inconjunction with the accompanying drawings that illustrate a specificembodiment of the present invention.

FIG. 1 is a block diagram showing an image coding apparatus according toembodiments.

FIG. 2 is a block diagram showing an image decoding apparatus accordingto the embodiments.

FIG. 3A is a schematic diagram for illustrating WPP according to theembodiments.

FIG. 3B is a schematic diagram for illustrating dependent slices in WPPaccording to the embodiments.

FIG. 4A is a schematic diagram for illustrating dependent slices whenWPP is not applied according to the embodiments.

FIG. 4B is a schematic diagram for illustrating dependent slices whenWPP is applied according to the embodiments.

FIG. 5 is a diagram showing a slice header of an entropy slice or adependent slice according to the embodiments.

FIG. 6 is a diagram showing an exemplary non-allowed slice structurewhen WPP is applied according to the embodiments.

FIG. 7 is a diagram showing an exemplary allowed slice structure whenWPP is applied according to the embodiments.

FIG. 8 is a schematic diagram showing a CABAC initialization processaccording to the embodiments.

FIG. 9 is a flow chart for a determination process in a CABACinitialization method for a dependent slice depending on characteristicsof a preceding slice according to the embodiments.

FIG. 10 is a diagram showing an exemplary slice structure according tothe embodiments.

FIG. 11 is a diagram showing an exemplary slice structure according tothe embodiments.

FIG. 12 is a diagram showing exemplary syntax of a slice headeraccording to Embodiment 1.

FIG. 13 is a flow chart for a determination process in a CABACinitialization method for a dependent slice according to Embodiment 1.

FIG. 14 is a diagram showing an exemplary picture partitioned intoslices according to Embodiment 2.

FIG. 15 is a flow chart for a determination process in a CABACinitialization method according to Embodiment 2.

FIG. 16 is a diagram showing an exemplary picture partitioned intoslices according to Embodiment 2.

FIG. 17 is a diagram showing an exemplary picture partitioned intoslices according to Embodiment 2.

FIG. 18 is a diagram showing an exemplary picture partitioned intoslices according to Embodiment 3.

FIG. 19 is a diagram showing a slice header according to Embodiment 4.

FIG. 20 is a diagram showing an exemplary picture partitioned into tilesaccording to Embodiment 4.

FIG. 21A is a diagram showing a scanning order according to Embodiment4.

FIG. 21B is a diagram showing a scanning order according to Embodiment4.

FIG. 22A is a diagram showing a relationship between a tile and a sliceaccording to Embodiment 4.

FIG. 22B is a diagram showing a relationship between a tile and a sliceaccording to Embodiment 4.

FIG. 22C is a diagram showing a relationship between a tile and a sliceaccording to Embodiment 4.

FIG. 23 is an example of partitioning a picture into tiles and slicesaccording to Embodiment 4.

FIG. 24 is a diagram showing a decoding order for a picture partitionedinto tiles according to Embodiment 4.

FIG. 25A is a diagram showing an exemplary non-allowed slice structureaccording to Embodiment 4.

FIG. 25B is a diagram showing an exemplary allowed slice structureaccording to Embodiment 4.

FIG. 25C is a diagram showing an exemplary allowed slice structureaccording to Embodiment 4.

FIG. 26A is a diagram showing an exemplary non-allowed slice structureaccording to Embodiment 4.

FIG. 26B is a diagram showing an exemplary allowed slice structureaccording to Embodiment 4.

FIG. 27A is a diagram showing an exemplary non-allowed slice structureaccording to Embodiment 4.

FIG. 27B is a diagram showing an exemplary allowed slice structureaccording to Embodiment 4.

FIG. 28 shows an overall configuration of a content providing system forimplementing content distribution services.

FIG. 29 shows an overall configuration of a digital broadcasting system.

FIG. 30 shows a block diagram illustrating an example of a configurationof a television.

FIG. 31 shows a block diagram illustrating an example of a configurationof an information reproducing/recording unit that reads and writesinformation from and on a recording medium that is an optical disk.

FIG. 32 shows an example of a configuration of a recording medium thatis an optical disk.

FIG. 33A shows an example of a cellular phone.

FIG. 33B shows a block diagram illustrating an example of aconfiguration of a cellular phone.

FIG. 34 illustrates a structure of multiplexed data.

FIG. 35 schematically shows how each stream is multiplexed inmultiplexed data.

FIG. 36 shows how a video stream is stored in a stream of PES packets inmore detail.

FIG. 37 shows a structure of TS packets and source packets in themultiplexed data.

FIG. 38 illustrates a data structure of a PMT.

FIG. 39 shows an internal structure of multiplexed data information.

FIG. 40 shows an internal structure of stream attribute information.

FIG. 41 shows steps for identifying video data.

FIG. 42 shows an example of a configuration of an integrated circuit forimplementing the moving picture coding method and the moving picturedecoding method according to each of embodiments.

FIG. 43 shows a configuration for switching between driving frequencies.

FIG. 44 shows steps for identifying video data and switching betweendriving frequencies.

FIG. 45 shows an example of a look-up table in which video datastandards are associated with driving frequencies.

FIG. 46A is a diagram showing an example of a configuration for sharinga module of a signal processing unit.

FIG. 46B is a diagram showing another example of a configuration forsharing a module of the signal processing unit.

DESCRIPTION OF EMBODIMENTS

(Underlying Knowledge Forming Basis of the Present Disclosure)

In relation to the image coding method and the image decoding methoddisclosed in the Background Art section, the inventors have found thefollowing problems.

First, an image coding apparatus and an image decoding apparatus in HEVCare described.

A video signal input to an image coding apparatus includes images eachreferred to as a frame (picture). Each frame includes pixels arranged ina two-dimensional matrix. In all the above-mentioned standards based onthe hybrid video coding, each individual frame is partitioned intoblocks each including pixels. The size of the blocks may vary, forinstance, in accordance with the content of an image. A different codingmethod may be used on a per block basis. For example, the largest sizeof the blocks is 64×64 pixels in HEVC. This largest size is referred toas a largest coding unit (LCU). The LCU can be recursively divided intofour coding units (CUs).

In H.264/MPEG-4 AVC, coding is performed on a per macroblock (usually16×16-pixel block) basis. There is a case where the macroblock isdivided into subblocks.

Typically, a coding step in hybrid video coding includes spatial and/ortemporal prediction. In short, each of current blocks to be coded ispredicted using blocks spatially or temporally adjacent to the currentblock, that is, coded video frames. Next, a residual block that is adifference between the current block and the prediction result iscalculated. Next, the residual block is transformed from spatial (pixel)domain to frequency domain. The transformation aims at reducingcorrelation of an input block.

Next, a transform coefficient resulting from the transformation isquantized. This quantization is lossy compression. Lossless compressionis performed on the quantization coefficient thus obtained, usingentropy coding. In addition, side information necessary forreconstructing the coded video signal is coded and output with the codedvideo signal. This information is, for instance, information aboutspatial prediction, temporal prediction, and/or quantization.

FIG. 1 is a block diagram showing an exemplary image coding apparatus100 compliant with H.264/MPEG-4 AVC and/or HEVC.

A subtractor 105 calculates a residual signal 106 (residual block) thatis a difference between a current block to be coded of an input imagesignal 101 and a corresponding prediction signal 181 (prediction block).The prediction signal 181 is generated by temporal prediction or spatialprediction by a prediction unit 180. A type of the prediction can bechanged on a per frame or block basis. A block and/or a frame predictedusing the temporal prediction is referred to as being inter-coded, and ablock and/or a frame predicted using the spatial prediction is referredto as being intra-coded.

A prediction signal used for the temporal prediction is derived using acoded and decoded image stored in a memory. A prediction signal used forthe spatial prediction is derived using boundary pixel values ofadjacent coded and decoded blocks stored in the memory. In addition, thenumber of intra-prediction directions is determined according to a sizeof coding units.

The residual signal 106 is also referred to as a prediction error or aprediction residual. A transformation unit 110 transforms the residualsignal 106 to generate a transformation coefficient 111. A quantizationunit 120 quantizes the transformation coefficient 111 to generate aquantization coefficient 121. An entropy coding unit 190 performsentropy coding on the quantization coefficient 121, with the purpose offurther reduction in an amount of data to be stored and losslesstransmission. For example, the entropy coding is variable-length coding.In addition, a length of a code word is determined based on aprobability of occurrence of a code.

A coded signal 191 (coded bitstream) is generated through the aboveprocessing.

The image coding apparatus 100 includes a decoding unit for obtaining adecoded image signal (reconstructed image signal). Specifically, aninverse transformation unit 130 performs inverse quantization andinverse transformation on the quantization coefficient 121 to generate aresidual signal 131. This residual signal 131 is strictly different fromthe original residual signal 106 due to a quantization error alsoreferred to as quantization noise.

Next, an adder 140 adds the residual signal 131 and the predictionsignal 181 to generate a decoded image signal 141. As stated above, tomaintain compatibility between the image coding apparatus and the imagedecoding apparatus, each of the image coding apparatus and the imagedecoding apparatus generates the prediction signal 181 using the codedand decoded image signal.

With the quantization, the quantization noise is superimposed on thedecoded image signal 141. The superimposed noise often differs for eachof blocks due to coding performed on a per block basis. With this, whenespecially strong quantization is performed, block boundaries of thedecoded image signal become salient. Such blocking noise causes imagequality to appear degraded in human visual recognition. To reduce theblocking noise, a deblocking filter 150 performs deblocking filterprocessing on the decoded image signal 141.

For instance, in deblocking filter processing in H.264/MPEG-4 AVC,filter processing suitable for each of regions is selected for eachregion. For example, when blocking noise is large, a strong (narrowband)low-pass filter is used, and when blocking noise is small, a weak(broadband) low-pass filter is used. The intensity of the low-passfilter is determined according to the prediction signal 181 and theresidual signal 131. The deblocking filter processing smoothes edges ofblocks. With this, subjective image quality of the decoded image signalis enhanced. An image on which filter processing has been performed isused for motion-compensating prediction of the next image. Consequently,this filter processing reduces an prediction error, thereby increasingcoding efficiently.

An adaptive loop filter 160 performs sample adaptive offset processingand/or adaptive loop filter processing on a decoded image signal 151after the deblocking filter processing, to generate a decoded imagesignal 161. As above, the deblocking filter processing enhances thesubjective image quality. In contrast, the sample adaptive offset (SAO)processing and the adaptive loop filter (ALF) processing aim atincreasing reliability on a per pixel basis (objective quality).

The SAO is processing for adding an offset value to a pixel according toadjacent pixels. The ALF is used to compensate image distortion causedby compression. For instance, the ALF is a Wiener filter having a filtercoefficient determined in a manner that a mean square error (MSE)between the decoded image signal 151 and the input image signal 101 isminimized. For example, a coefficient of the ALF is calculated andtransmitted on a per frame basis. Moreover, the ALF may be applied to anentire frame (image) or a local region (block). In addition, sideinformation indicating a region on which filter processing is to beperformed may be transmitted on a per block basis, frame basis, orquadtree basis.

To decode an inter-coded block, it is necessary to store, in a referenceframe buffer 170, part of a coded and decoded image. The reference framebuffer 170 holds the decoded image signal 161 as a decoded image signal171. The prediction unit 180 performs inter-prediction usingmotion-compensating prediction. Specifically, a motion estimator firstsearches blocks included in a coded and decoded video frame for a blockmost similar to a current block. This similar block is used as theprediction signal 181. A relative displacement (motion) between thecurrent block and the similar block is transmitted as motion data to theimage decoding apparatus. This motion data is, for instance,three-dimensional motion vectors included in side information providedwith coded video data. Here, the expression “three-dimensional” includesspatial two dimension and temporal one dimension.

It is to be noted that to optimize prediction accuracy, a motion vectorhaving a spatial sub-pixel resolution such as a half pixel resolutionand a quarter pixel resolution may be used. The motion vector having thespatial sub-pixel resolution indicates a spatial location in a decodedframe where no pixel value exists, that is, a location of a subpixel.Thus, it is necessary to spatially interpolate a pixel value to performmotion-compensating prediction. This interpolation is performed by aninterpolation filter (included in the prediction unit 180 shown in FIG.1), for instance.

Both in the intra-coding mode and the inter-coding mode, thequantization coefficient 121 is generated by transforming and quantizingthe residual signal 106 that is the difference between the input imagesignal 101 and the prediction signal 181. Generally, the transformationunit 110 uses, for this transformation, two-dimensional discrete cosinetransform (DCT) or orthogonal transformation that is an integer versionof the DCT. This efficiently reduces correlation of natural video. Inaddition, a low-frequency component is generally more important to imagequality than a high-frequency component, and thus more bits are used forthe low-frequency component than for the high-frequency component.

The entropy coding unit 190 transforms a two-dimensional array of thequantization coefficient 121 into a one-dimensional array. Typically,so-called zigzag scanning is used for this transformation. In the zigzagscanning, a two-dimensional array is scanned in a predetermined orderfrom a DC coefficient at the left top corner of the two-dimensionalarray to an AC coefficient at the right bottom corner of the same.Energy normally concentrates in coefficients at the left upper part ofthe two-dimensional array which correspond to a low frequency, and thuswhen the zigzag scanning is performed, the latter values tend to bezero. With this, it is possible to achieve efficient coding by usingRun-length encoding as part of or pre-processing of the entropy coding.

In H.264/MPEG-4 AVC and HEVC, various types of the entropy coding areused. Although the fixed-length coding is performed on some syntaxelements, the variable-length coding is performed on most of the syntaxelements. In particular, context-adaptive variable-length coding isperformed on a prediction residual, and various other types of integercoding are performed on other syntax elements. In addition, there isalso a case where context-adaptive binary arithmetic coding (CABAC) isused.

The variable-length coding enables lossless compression of a codedbitstream. However, code words are of variable length, and thus it isnecessary to continuously decode the code words. In other words, beforea preceding code word is coded or decoded, a following code word cannotbe coded or decoded without restarting (initializing) the entropy codingor without separately indicating a location of the first code word(entry point) when decoding is performed.

A bit sequence is coded into one code word by arithmetic coding based ona predetermined probability model. The predetermined probability modelis determined based on contents of a video sequence in the case ofCABAC. Thus, the arithmetic coding and CABAC are performed moreefficiently as a length of a bitstream to be coded is greater. To put itanother way, the CABAC applied to the bit sequence is more efficient ina bigger block. The CABAC is restarted at the beginning of eachsequence. Stated differently, the probability model is initialized atthe beginning of each video sequence with a determined value or apredetermined value.

H.264/MPEG-4, H.264/MPEG-4 AVC, and HEVC include two functional layers,the video coding layer (VCL) and the network abstraction layer (NAL).The video coding layer provides a coding function. The NAL encapsulatesinformation elements into standard units referred to as NAL units,depending on a use such as transmission over a channel or storage into astorage device. The information elements are, for instance, codedprediction error signals or information necessary for decoding a videosignal. The information necessary for decoding a video signal is aprediction type, a quantization parameter, a motion vector, and so on.

Each of the NAL units can be classified into: a VCL NAL unit includingcompressed video data and related information; a non-VCL unitencapsulating additional data such as a parameter set relating to anentire video sequence; and supplemental enhancement information (SEI)for providing additional information usable for increasing decodingaccuracy.

For example, the non-VCL unit includes a parameter set. The parameterset refers to a set of parameters relating to coding and decoding of acertain video sequence. Examples of the parameter set include a sequenceparameter set (SPS) including parameters relating to coding and decodingof an entire video sequence (picture sequence).

The sequence parameter set has a syntax structure including syntaxelements. A picture parameter set (PPS) to be referred to is specifiedby pic_parameter_set_id, a syntax element included in each slice header.In addition, an SPS to be referred to is specified byseq_parameter_set_id, a syntax element included in the PPS. As above,the syntax elements included in the SPS are applied to the entire codedvideo sequence.

The PPS is a parameter set that defines parameters applied to coding anddecoding of one picture included in a video sequence. The PPS has asyntax structure including syntax elements. The picture parameter set(PPS) to be referred to is specified by pic_parameter_set_id, a syntaxelement included in each slice header. As above, the syntax elementsincluded in the SPS are applied to an entire coded picture.

Therefore, it is easier to keep track of the SPS than the PPS. This isbecause the PPS changes for each picture, whereas the SPS stays constantfor the entire video sequence that may last for several minutes orseveral hours.

A VPS is parameters in the highest layer, and includes informationrelating to video sequences. The information included in the VPS is abit rate, a temporal_layering structure of the video sequences, and soon. In addition, the VPS includes information about a dependency betweenlayers (dependency between different video sequences). As a result, theVPS can be considered as information about the video sequences, and anoutline of each of the video sequences can be obtained based on the VPS.

FIG. 2 is a block diagram showing an exemplary image decoding apparatus200 compliant with H.264/MPEG-4 AVC or HEVC video coding standard.

A coded signal 201 (bitstream) input to the image decoding apparatus 200is transmitted to an entropy decoding unit 290. The entropy decodingunit 290 decodes the coded signal 201 to obtain a quantizationcoefficient and information elements necessary for decoding such asmotion data and a prediction mode. In addition, the entropy decodingunit 290 inversely scans the obtained quantization coefficient with thepurpose of obtaining a two-dimensional array, to generate a quantizationcoefficient 291, and outputs the quantization coefficient 291 to aninverse transformation unit 230.

The inverse transformation unit 230 inversely quantizes and transformsthe quantization coefficient 291 to generate a residual signal 231. Theresidual signal 231 corresponds to a difference obtained by subtractinga prediction signal from an input image signal that has no quantizationnoise and error and is input to an image coding apparatus.

A prediction unit 280 generates a prediction signal 281 using temporalprediction or spatial prediction. Normally, decoded information elementsfurther include information such as a prediction type in the case of theintra-prediction, or information necessary for prediction such as motiondata in the case of the motion-compensating prediction.

An adder 240 adds the residual signal 231 in a spatial domain and theprediction signal 281 generated by the prediction unit 280, to generatea decoded image signal 241. A deblocking filter 250 performs deblockingfilter processing on the decoded image signal 241 to generate a decodedimage signal 251. An adaptive loop filter 260 performs sample adaptiveoffset processing and adaptive loop filter processing on the decodedimage signal 251, to generate a decoded image signal 261. The decodedimage signal 261 is output as a display image and stored as a decodedimage signal 271 in a reference frame buffer 270. The decoded imagesignal 271 is used for a subsequent block or temporal or spatialprediction of an image.

Compared to H.264/MPEG-4 AVC, HEVC has a function to assist advanceparallel processing of coding and decoding. As with H.264/MPEG-4 AVC,HEVC enables partitioning of a frame into slices. Here, each of theslices includes consecutive LCUs in a scanning order. In H.264/MPEG-4AVC, each slice is decodable, and spatial prediction is not performedbetween the slices. Thus, it is possible to perform the parallelprocessing on a per slice basis.

However, the slice has a considerably large header, and there is nodependency between the slices, thereby decreasing compressionefficiency. In addition, when the CABAC is performed on a small datablock, the efficiency of the CABAC is decreased.

In response to this, wavefront parallel processing (WPP) has beenproposed to allow more efficient parallel processing. In the WPP, aprobability model after the second LCU in a previous row is processed isused as a CABAC probability model used to reset the first LCU (lead LCU)in each of LCU rows (hereinafter, simply also referred to as “rows”) ofa picture. This maintains a dependency between blocks. Thus, it ispossible to decode the LCU rows in parallel. In addition, processing ofeach row is delayed by two LCUs relative to the previous row.

Information indicating an entry point, a position at which decoding ofan LCU row is started, is signaled in a slice header. It is to be notedthat Non Patent Literature (NPL) 1 describes the details of the WPP.

A method for using a tile is available as another approach for enhancingparallelization. A frame (picture) is partitioned into tiles. Each ofthe tiles is rectangular and includes LCUs. Boundaries between the tilesare set to partition the picture into matrices. In addition, the tilesare processed in a raster scanning order.

All dependencies are lost at the boundary of each tile. The entropycoding such as the CABAC is reset at the beginning of the tile. It is tobe noted that only the deblocking filter processing and the sampleadaptive offset processing are applied over the boundaries between thetiles. Thus, it is possible to code or decode the tiles in parallel. Itis to be noted that Non Patent Literature (NPL) 2 and Non PatentLiterature (NPL) 3 describe the details of the tiles.

Moreover, the concepts of dependent slice and entropy slice have beenproposed to make the concept of slice suitable more for parallelizationthan for error resilience, the original purpose of slices inH.264/MPEG-4 AVC. In other words, the following three types of slicesare used in HEVC: a normal slice, a dependent slice, and an entropyslice.

The normal slice is a slice already known from H.264/MPEG-4 AVC. Thespatial prediction cannot be performed between normal slices. In short,prediction cannot be performed over boundaries between slices. To put itanother way, the normal slice is coded without referring to anotherslice. The CABAC is restarted at the beginning of each slice to allowseparate decoding of the slice.

The normal slice is used for the beginning of a frame. Stateddifferently, each frame must start from the normal slice. The normalslice has a header including parameters necessary for decoding slicedata.

The entropy slice is a slice that enables the spatial prediction betweena parent slice and the entropy slice, for instance. Here, the parentslice is a normal slice preceding the entropy slice. The parent sliceand the entropy slice are parsed independently.

The slice data is parsed independently of the parent slice and theentropy slice except syntax elements of a slice header. In other words,CABAC decoding of the entropy slice requires syntax elements included ina slice header of the parent slice. For example, the syntax elementsinclude switch information indicating whether the slice data includesfiltering parameters. When the slice data includes the filteringparameters, a CABAC decoding unit extracts the switch information.Otherwise, the CABAC decoding unit does not assume filtering data. Toput it another way, after parsing a slice header of the normal slice,the CABAC decoding unit is capable of processing the parent slice andthe entropy slice in parallel.

However, the parent slice may be, for instance, the normal slice, and isrequired for reconstructing pixel values of the entropy slice. Inaddition, the CABAC is restarted at the beginning of the slice to allowthe independent parsing of the entropy slice.

A slice header shorter than the slice header of the normal slice can beused for the entropy slice. The slice header includes a coding parametersubset regarding information transmitted within the slice header of thenormal slice. Information not included in the slice header of theentropy slice is copied from the slice header of the parent slice.

The dependent slice is similar to an entropy slice for which the CABACis not restarted. The restarting of the CABAC includes an initializingprocess in which a context table (probability table) is initialized to adefault value, and a termination process (terminate process) in thearithmetic coding or arithmetic decoding.

The slice header of the parent slice is used to parse and/or decode thedependent slice. Since the dependent slice cannot be parsed without theparent slice, when the parent slice is not obtained, the dependent slicecannot be decoded. The parent slice is usually a slice preceding thedependent slice in coding order and including a complete slice header.The same holds true for a parent slice of the entropy slice.

Generally, the entropy slice can be considered as depending on headerparameters of another slice, and thus the present disclosure can beapplied to both the dependent slice and the entropy slice.

As described above, the dependent slice and the entropy slice use theslice header (the information not included in the slice header of thedependent slice) of the preceding slice in coding order of the slices.This rule is recursively applied. It is recognized that a parent sliceon which a target dependent slice depends is referable. Referringincludes use of the spatial prediction between slices, a common CABACstate, and so on. The dependent slice uses a CABAC context tablegenerated at the end of the preceding slice. In this way, the dependentslice continuously uses the generated table without initializing a CABACtable to a default value. NPL 3 describes the entropy slice and thedependent slice (see “dependent_slice_flag” on page 73, for instance).

In the case of using the WPP, when a dependent slice starts at thebeginning of an LCU row and a slice including an LCU located to theupper right of the beginning of the LCU row is indicated as beingreferable, the dependent slice uses a CABAC context table of the LCU.

HEVC presents several profiles. A profile includes settings of an imagecoding apparatus and an image decoding apparatus suitable for aparticular application. For instance, a “main profile” includes onlynormal slices and dependent slices, but not entropy slices.

As stated above, a coded slice is encapsulated into a NAL unit, furtherencapsulated into, for example, a real time protocol (RTP), and finallyencapsulated into an internet protocol (IP) packet. This protocol stackor another protocol stack allows transmission of coded video in theInternet or a packet-oriented network such as a proprietary network.

Typically, a network includes at least one router, and the routerincludes dedicated hardware that operates at ultrahigh speed. The routerreceives IP packets, parses their headers, and appropriately forwardsthe IP packets to their respective destinations. The router is requiredto process communication from many sources, and thus packets thatcontrol logic must be as simple as possible. The router at least needsto check destination address fields included in the IP headers, todetermine paths through which the IP packets are forwarded. A smart(media-aware) router additionally checks dedicated fields in networkprotocol headers such as the IP headers, RTP headers, and NALU headers,to further provide support for the quality of service (QoS).

As is clear from the above description of the video coding, thedifferent types of slices defined for the parallel processing such asthe dependent slice and the entropy slice differ in significance forimage degradation when data are lost. The dependent slice cannot beparsed and decoded without the parent slice. This is because an entropycoding unit or an entropy decoding unit cannot be restarted at thebeginning of the dependent slice. Thus, the parent slice can be said tobe more important in reconstructing an image or video than the parentslice.

In HEVC, the dependent slice and the entropy slice have a dependencybetween slices (dependency within a frame) as an additional aspect ofthe dependency. This dependency is not the only dependency within theframe.

Since parallel processing of slices is performed for each tile, contextsof an arithmetic coding unit and an arithmetic decoding unit aredetermined by default settings or coded or decoded slices. However, adependency of a header and a dependency of arithmetic codinginitialization are different from each other, and thus there is apossibility of delay or further complexity in contradiction to thepurposes of the parallel processing and a dependent slice mechanism.

The dependent slice can be used in conjunction with a parallelprocessing tool such as the WPP and tiles. In addition, a wavefront(substream) that makes it possible to reduce transmission delay withoutcausing coding loss can be generated using the dependent slice.

The CABAC is not restarted for the dependent slice, and thus thedependent slice can be used as an entry point of a CABAC substream. Inaddition, to indicate an entry point for independent parsing,information indicating the entry point may be signaled in a bitstream.In particular, when two or more CABAC substreams are encapsulated into anormal slice or a dependent slice, an entry point is signaled explicitlyusing the number of bytes for each substream. Here, the substreamindicates a portion of a stream separately parsable based on the entrypoint. Moreover, each dependent slice requires a header of a NAL unit,and thus the dependent slice can be used as a “marker” of an entrypoint. In short, the entry point corresponding to such a marker can besignaled.

It is possible to simultaneously use a method for explicitly signalingan entry point and a method for marking an entry point through adependent slice. Here, there is a need to identify an entry point ofeach NAL unit (beginning of each NAL header). It is to be noted that anymethod can be used for the identification method. For example, thefollowing two methods can be used.

The first method is inserting a start code of 3 bytes at the beginningof each NAL header, for instance. The second method is packetizing eachNAL unit into a different packet. In addition, a size of a slice headermay be reduced due to the dependency of the slice.

These methods allow parallel CABAC parsing of an entropy slice. This isbecause the CABAC is always restarted at the beginning of the entropyslice. In parallel processing of the CABAC, a bottleneck can be overcomeby the parallel CABAC parsing after consecutive pixel reconstructionprocessing. Specifically, with a WPP parallelization tool, decoding ofeach LCU row can be achieved by one processing core. It is to be notedthat different LCU rows may be assigned to respective cores. Forexample, two rows may be assigned to one core, or one row may beassigned to two cores.

FIG. 3A is a diagram showing a picture 300 partitioned into rows. Eachof the rows includes largest coding units (LCUs). A row 301 (Wavefront1) and a row 302 (Wavefront 2) are processed in parallel. As shown by anarrow of CABAC states in FIG. 3A, after the first two LCUs are decodedin the row 301, processing of the row 302 is started. In addition, CABACstates after the first two LCUs of the row 301 are coded or decoded areused for CABAC initialization of the row 302. Thus, the processing ofthe row 302 can be started after the processing of the first two LCUs ofthe row 301 is finished. In short, the delay of the two LCUs existsbetween the two processing cores.

FIG. 3B is a diagram showing a usage example of dependent slices for theWPP. A picture 310 shown in FIG. 3B includes rows 311 to 314. Here, therow 311 (Wavefront 1), the row 312 (Wavefront 2), and the row 313(Wavefront 3) are processed using separate cores.

The dependent slices allow the WPP that is capable of reducing delay.The dependent slices have no complete slice header. Moreover, when entrypoints (the entry points of the dependent slices which are known for theabove rule) are known, the dependent slices can be decoded independentlyof other slices. Furthermore, the dependent slices allow the WPPsuitable for low delay applications without causing coding loss.

In a normal case where a substream (LCU row) is encapsulated into aslice, it is necessary to insert a clear entry point into a slice headerto surely perform entropy coding and entropy decoding in parallel. Forthis reason, transmission of the slice can be prepared only after thelast substream of the slice is completely coded. In addition, the sliceheader is completed only after coding of all substreams in the slice isfinished. In other words, transmission of the beginning of the slicecannot be started through packet fragmentation in the RTP/IP layer untilprocessing of the whole slice is finished.

However, when a dependent slice is used, the dependent slice can be usedas an entry point marker, and thus it is not necessary to performnotification using an explicit signal of an entry point. Consequently,it is possible to split a normal slice into many dependent sliceswithout coding loss. In addition, the dependent slices can betransmitted immediately after coding of the encapsulated substream isfinished (or before the coding in the case of the packet fragmentation).

The dependent slices do not decrease a spatial prediction dependency. Inaddition, the dependent slices do not decrease a parsing dependency.This is because parsing of a target dependent slice normally requiresCABAC states of a preceding slice.

When the dependent slice is not allowed, each LCU row can be used as aslice. Although such a configuration reduces the transmission delay,significant coding loss is caused simultaneously as stated above.

The following assumes a case where a whole frame (picture) isencapsulated into one slice. In this case, to make parallel parsingpossible, it is necessary to signal, in a slice header, an entry pointof a substream (LCU row). This causes a transmission delay at a framelevel. To put it another way, it is necessary to modify the header afterthe whole frame is coded. The encapsulation of the whole picture intothe one slice itself does not worsen the transmission delay. Forinstance, transmission of part of the slice may be started before thecoding is completely finished. However, when the WPP is used, it isnecessary to modify the slice header later to indicate the entry point.Thus, it is necessary to delay the transmission of the whole slice.

As above, the usage of the dependent slice makes it possible to reducethe delay. As shown in FIG. 3B, the picture 310 is partitioned into therow 311, a normal slice, and the rows 312, 313, and 314, dependentslices. When each row is one dependent slice, it is possible to delaytransmission of the one row without coding loss. This is because thedependent slice does not decrease the spatial prediction dependency andrestart a CABAC engine.

FIG. 4A and FIG. 4B each are a diagram showing another example of CABACinitialization. FIG. 4A shows the CABAC initialization when the WPP isnot used. The WPP and tiles are both unused. The usage of the normalslices and the dependent slices together is allowed.

A dependent slice (3) copies the header of a normal slice (2). In short,the normal slice (2) is a parent slice of the dependent slice (3). Thedependent slice (3) uses a context table generated at the end of thenormal slice (2). The dependent slice (3) depends not on a normal slice(1) but on the normal slice (2). In a word, spatial prediction does notexist between the normal slice (1) and the dependent slice (3).

FIG. 4B is a diagram showing the CABAC initialization when the WPP isused. The usage of the normal slices, the dependent slices, and the WPPtogether is allowed.

A dependent slice (3) copies the header of a normal slice (2). Thedependent slice (3) is expected to use a context table generated at theend of the second LCU of the normal slice (1). However, since the slice(2) is a normal slice, it is indicated that the second LCU of the slice(1) cannot be referred to. In short, the slice (1) is not referred to,because the slice (1) is not an immediately preceding slice of adependent slice in coding order.

However, the slice (2) is used as a reference slice for the slice (3)and a slice (4). In other words, when decoding of the slice (3) isstarted, it is necessary to initialize CABAC states to a default value(indicated by a dashed arrow in FIG. 4B). The dependent slice (4) usesCABAC states (solid arrow) after the right upper second LCU whichconforms to the above-mentioned WPP conditions.

FIG. 5 is a diagram showing an exemplary syntax of a slice headercompliant with a current HEVC reference model (HM8.0). A slice header320 includes a syntax element dependent_slice_flag which indicateswhether a target slice is a dependent slice or a normal slice.

As is clear from a row 321 in FIG. 5, when the dependent_slice_flag isequal to 0, the header includes slice header information. In short, theslice has a complete header. Otherwise, the header does not include theslice header information. To put it another way, as above, the dependentslice and an entropy slice have no complete slide header, and refer tothe header of a preceding normal slice.

Entry points are signaled later to support parallel processing. Evenwhen the entropy coding unit or the entropy decoding unit is notrestarted, it is possible to independently perform parallel decoding ofpart of a video stream (substream) between the entry points, using theentry points. As stated above, entry points are marked for the dependentslice, the normal slice, and the entropy slice.

In HEVC, several parallel processing tools are available. As mentionedabove, the tools include the WPP, the dependent slice, the entropyslice, and the tile. However, since these tools are not compatible witheach other, there is a limit to combined usage of the tools. The usageof the tile and the slice together is generally allowed.

However, there is a restriction that in a major profile, one slice needsto be subdivided into an integer number of tiles greater than or equalto 1, and one tile needs to be subdivided into an integer number ofslices greater than or equal to 1. This restriction is typically appliedto a specific profile (or a specific level of a profile). The purpose ofthe restriction is to reduce complexity of hardware implementation.

When entropy_coding_sync_enabled_flag of a PPS is equal to 1 (i.e., theWPP is used), and the first coding block in a slice is not the firstcoding block of the first coding tree block in a row of coding treeblocks in a tile, a condition under which a bitstream meets standards isthat the last coding block in the slice belongs to the same row of thecoding tree blocks as the first coding block in the slice. A coding treeindicates a structure of an LCU and recursive further subdivision ofeach of LCUs into four blocks. Stated differently, when the WPP can beused, and the slice does not start at the beginning of a target LCU row,the slice has to end at or before the end of the target LCU row. NPL 3describes details regarding not only parallel processing means but alsoHEVC syntax.

The following describes this restriction with reference to FIG. 6. Apicture 330 shown in FIG. 6 includes slices 331, 332, and 333, normalslices. The slices 331 and 332 are included in one LCU row. The slice333 is a non-allowed slice, because the slice 333 extends over LCU rows(three rows in this example). The slice 333 has to end at the end of thefirst LCU row in accordance with the above restriction.

FIG. 7 is a diagram showing a picture 340 having an allowed slicestructure when the WPP is used. The picture 340 includes slices 341,342, and 343, normal slices, and a slice 344, a dependent slice. Theslices 341, 342, and 343 are included in the first LCU row. The slice344 includes subsequent two rows.

The CABAC initialization of the slice 344 depends on the other slices341, 342, and/or 343, because the slice 344 is the dependent slice. Whenany of the slices 342 and 343 is a normal slice as shown in FIG. 7, theslice 344 is initialized to default CABAC states. Otherwise, a WPP tableis used. In other words, CABAC states after the second LCU in an LCU rowabove a target row is processed are used for the initialization.

In this example, as described in FIG. 4B and stated in the relateddescription of the CABAC initialization, the dependent slice 344 isinitialized using predetermined default CABAC states.

Thus, the CABAC initialization is based on preceding slices. Thus,processing, especially parsing, of a target slice depends on otherslices. Specifically, it is determined whether a CABAC context isinitialized with a default value or a WPP value depending on a type ofthe preceding slices of the target slice. In this way, it is checkedwhether or not the preceding slices can be used, and an initializationmethod to be applied to the target slice is determined. In short,processing having a quite complicated order is required. The followingdescribes such processing.

A first slice 341 has at least two LCUs, and thus CABAC states after thefirst two LCUs are coded or decoded can be referred to.

When a slice 342 or a slice 343 is lost, the slice 344 cannot beaccurately decoded. This is because the CABAC initialization cannot beperformed due to an unknown type of the slice 342 or the slice 343. Inother words, because the CABAC initialization cannot be performed on theslice 344 even when only information about the two preceding slices isabsent and the slice 344 has been correctly obtained, data of thecorrectly obtained slice 344 is discarded. Thus, it is necessary toperform error concealment on the slice 344. From this reason, there is apossibility that image degradation results from distortion due toincomplete error concealment.

Here, in a slice header, most of syntax elements (these are mainlyswitching of control such as a specific filtering operation) need to bedetermined for all slices included in a frame. In addition, althoughsome of the syntax elements can be changed on a slice basis, all controlparameters determined for a whole frame are held in most of processes byan image coding apparatus. Thus, the following method can be used as anerror concealment method. This method requires only informationindicating whether a lost slice is a dependent slice or a normal slice.

When packets arrive not in order, a decoding delay increases. In otherwords, when packet reordering is expected, there is a possibility ofincreasing the decoding delay. This contradicts with providing an ultralow delay using a dependent slice, the fundamental aim of the WPP.

FIG. 8 is a diagram showing a further example of the CABACinitialization process. In FIG. 8, the structure of the slices shown inFIG. 7 is assumed. A picture 350 shown in FIG. 8 includes a slice 351and a slice 354. The slice 351 is a normal slice and the first slice ina frame, and includes four LCUs. The CABAC is initialized to a defaultstate value (zero state) at the beginning of the frame, that is, thebeginning of the slice 351. It is to be noted that default states may bepresent, and in this case, one of the default states is selected. Here,the default state refers to a predetermined value in a probability modelof arithmetic coding.

When data of the slice 342 and the slice 343 are absent due to missingor an error although data belonging to a dependent slice 354 isobtained, the dependent slice 354 cannot be decoded. This is because, asstated above, the CABAC engine cannot be initialized without the data ofthe slices 342 and 343.

FIG. 9 is a flow chart for a determination process in an initializationmethod which is performed when the dependent slice 354 is obtained. Toput it another way, this flow chart shows a method of depending on twoor more slices in the CABAC initialization.

It is assumed that the following conditions are set for a slice (4)(dependent slice 354). The WPP can be used. dependent_slice_enabled_flagof an SPS is set to 1. The position of the slice (4) satisfies Equation1.slice_address % numLCUinRow=0  (Equation 1)

Here, “%” represents a modulo operation (remainder of integer division).The parameter numLCUinRow represents the number of LCUs per row of thepicture 350. Thus, the condition of Equation 1 is satisfied at thebeginning of the row. The parameter numLCUinRow can be derived from thesettings of the SPS.

First, it is determined whether or not the slice (4) is a dependentslice (S101). When the slice (4) is not the dependent slice (No inS101), default initialization is performed.

As shown in FIG. 8, when the slice (4) is the dependent slice (Yes inS101), i is set to 3 (S102). In short, the slice (3) preceding is theslice (4) is set as a slice i.

Next, it is determined whether or not the slice i starts from a rowabove a row of the slice (4) (S103). Here, since i is set to 3, theslice i is the slice (3) preceding a dependent slice to be processed(slice (4)).

When the slice i does not start from the row above the row of the slice(4) (No in S103), WPP initialization (initialization using a WPP table)is performed (S107).

In contrast, when the slice i starts from the row above the row of theslice (4) (Yes in S103), that is, the case shown in FIG. 8, it isdetermined whether or not the slice i is a dependent slice (S104).

When the slice i is not the dependent slice (No in S104), a startposition of the slice i is then analyzed. Specifically, it is determinedwhether or not slice_address % numLCUinRow is less than 2 (S106). Inshort, it is determined whether the start position of the slice i is thefirst LCU or the second LCU in the row.

When slice_address % numLCUinRow is less than 2 (Yes in S106), the WPPinitialization is performed (S107). In contrast, when slice_address %numLCUinRow is greater than or equal to 2 (No in S106), the defaultinitialization is performed (S108).

Moreover, when the slice i is the dependent slice (Yes in S104), a startposition of the slice i is analyzed. Specifically, it is determinedwhether or not slice_address % numLCUinRow is less than 3 (S105). Inshort, it is determined whether the start position of the slice i is thefirst LCU, the second LCU, or the third LCU in the row.

When slice_address % numLCUinRow is less than 3 (Yes in S105), the WPPinitialization is performed (S107). In contrast, when slice_address %numLCUinRow is greater than or equal to 3 (No in S105), theinitialization is not performed, and the index i is decreased by 1(S109). In short, in this example, the slice (2) preceding the targetslice (slice (4)) by two slices is set as the slice i. Then, theprocesses subsequent to step S103 are performed on the slice (2).Moreover, when the same determination is made for the slice (2), theslice (1) is then set as the slice i.

FIG. 10 is a diagram showing a picture 360. The picture 360 includesfive slices 361 to 365. The slice 361 is a normal slice and includes thewhole first row. The slice 362 is a dependent slice and includes thewhole second row. The third row includes the dependent slice 363 and theslice 364. The slice 365 is a dependent slice and includes the wholefourth row.

The following discusses cases where the slice 364 is the dependent sliceand where the slice 364 is the normal slice when the slice 364 is lostor delayed. In addition, here, the slice 363 has at least two LCUs.

When the slice 364 is lost, an image decoding apparatus cannot determinea type of the slice 364. When the lost slice 364 is the dependent slice,it is possible to continue decoding of the slice 365 and subsequentslices with a small margin of error in reconstruction processing. Thisis because, as described with reference to FIGS. 8 and 9, the slice 365uses CABAC states of the second LCU of the slice 363. Thus, the CABACinitialization processing causes no error. However, since the slice 365uses spatial prediction from the slice 364, there is a possibility thatthe pixel reconstruction processing causes an error.

In contrast, when the lost slice 364 is the normal slice, the slice 365cannot be decoded. This is because some of syntax elements might useinformation of a slice header of the lost slice 364. Stated differently,it is because the normal slice 364 is a parent slice of the dependentslice 365, and the information of the parent slice is required forparsing and decoding of the dependent slice 365.

When the type of the lost slice 364 is unknown, the image decodingapparatus discards the decodable slice 365 to avoid wrong decoding thatis likely to occur when the lost slice 364 is the normal slice. This isinefficient because the slice 365 is discarded even when the data of theslice 365 is correctly obtained. In addition, it is necessary to discardall dependent slices subsequent to the slice 365.

When the slice 364 is the normal slice, a CABAC engine is initialized toa default CABAC value (refer to the case of No in S101 in FIG. 9) todecode the slice 365. Thus, the slice 365 does not depend on the slice363. In addition, spatial prediction between the slice 363 and the slice365 is not performed. As above, the CABAC is initialized to the defaultvalue at the start position of the slice 365, and thus the dependentslice 365 becomes similar to the normal slice.

However, the normal slice has a complete slice header. In contrast, theslice 365 has only a short slice header and depends on parameters set bya slice header of a preceding normal slice. In other words, when theslice 365 is the dependent slice, although there is the advantage thatthe size of the header can be reduced, the advantage is not so great. Incontrast, when the slice 365 is the normal slice, the slice 365 can bedecoded. As just described, in the above cases, the advantage isconsidered to be greater when the slice 365 is set as the normal slicethan when the slice 365 is set as the dependent slice.

However, in the WPP, the dependent slice is designed not to ensurerobustness against loss but to enable a WPP operation at an ultra lowdelay. On the other hand, in the case of an ultra low delay applicationover a network such as a real-time application, packet loss and packetreordering are expected. In such a case, when the slice 364 can befinally obtained, the slice 365 can be decoded. However, at least anincreased delay and the packet loss are caused. Thus, the WPP isperformed not in an optimum state in a lossy environment.

FIG. 11 is a diagram showing another problem associated with the CABACinitialization when the WPP is used, and showing a picture 370. Thepicture 370 includes four slices 371 to 374.

The slice 371 is a normal slice, and the slice 372 is a dependent slice.Here, the slice 371 has at least two LCUs. The first row of the picture370 includes the slices 371 and 372. The second row of the picture 370includes the slices 373 and 374, dependent slices.

In this case, an image coding apparatus is assumed to use at least twoprocessor cores. To put it another way, when the WPP is used, the imagecoding apparatus codes and parses two LCU rows in parallel. Thus, theslice 373 becomes available long before the slice 372 becomes available.

However, since the CABAC initialization for the slice 373 depends on theslice 372, decoding of the slice 373 cannot be started. Thus, it is notpossible to make a delay of starting coding or decoding between rowssmaller than entire one LCU row. This contradicts with the WPP's purposeof decreasing the delay up to two LCUs.

The following describes parallel processing of coding and transmitting aslice, as shown in FIG. 11. Two processing units such as processor coresand processors simultaneously code the first slices (slice 371 and slice373) of respective rows. When the coding ends, the coded slices 371 and373 are encapsulated into packets having packet numbers (packet_id) of 0and 4, respectively. Here, the packet number of 4 is selected to reservea small number for the slice 372 and possibly for another NALU.

When coding of the slice 372 is completed, the slice 372 is encapsulatedinto a packet having a packet number of 1 and is transmitted. Inaddition, two NAL units having corresponding packet numbers of 2 and 3and dummy (filler) data are generated to avoid determination of lostpacket numbers of 2 and 3 as packet loss.

In HEVC, this is achieved by using a filler_data SEI message or apredetermined NAL unit type reserved for filler data. As above, when apacket ID needs to be increased by 1 for each NAL unit, a filler typeNALU is used to fill the gap.

Initialization of a target row depends on the second LCU in a row abovethe target row. Moreover, when a slice is inserted into after the secondLCU, the insertion is problematic in terms of influencing thedetermination of the CABAC initialization. The present disclosureprovides a method for deriving a more efficient relationship between WPPand usage of a dependent slice, based on this analysis and problem. Asituation should be avoided where the CABAC initialization for one rowdepends on another row to maintain efficiency of the WPP.

Moreover, the same problem as above occurs when the tile is used insteadof the WPP.

According to an exemplary embodiment disclosed herein, an image decodingmethod for decoding a bitstream including a coded signal resulting fromcoding tiles and slices into which an image is partitioned, the methodcomprising decoding the coded signal, wherein each of the slices iseither a normal slice having, in a header, information used for an otherslice or a dependent slice which is decoded using information includedin a slice header of another slice, and when the normal slice startsfrom a position other than a beginning of a first tile, a second tilecoded next to the first tile does not start from the dependent slice.

With this, it is possible to prevent an occurrence of a case where aslice at the beginning of the second tile refers to a slice at aposition other than the beginning of the first tile, thereby increasingefficiency when parallel tile processing and dependent slices are usedtogether.

For instance, in the decoding, the first tile and the second tile may bedecoded in parallel, and when the decoding of the second tile isstarted, the second tile may be decoded without referring to partitioninformation indicating a slice structure of the first tile.

For example, when a slice at a beginning of a third tile is thedependent slice, the dependent slice may include the whole third tile.

For instance, when the first tile includes a slice starting from aposition other than the beginning of the first tile, the second tile maynot start from the dependent slice.

For example, the image decoding method may further include obtaining,from a slice header of a slice, information indicating whether the sliceis either the normal slice or the dependent slice.

For instance, a slice at a beginning of the image may be the normalslice, and each of all other slices may be the dependent slice.

For example, the image decoding method may further include obtaining,from the bitstream, a restriction indicator indicating that partitioningof a picture is restricted.

For instance, the image decoding method may further include obtaining,from the bitstream, an indicator indicating whether or not a parentslice whose slice header is used for the dependent slice starts from abeginning of a tile.

According to an exemplary embodiment disclosed herein, an image codingmethod for coding tiles and slices into which an image is partitioned,to generate a bitstream, the method comprising: partitioning the imageinto the tiles and the slices; and coding the tiles and slices resultingfrom the partitioning, wherein each of the slices is either a normalslice having, in a header, information used for an other slice or adependent slice which is decoded using information included in a sliceheader of another slice, and in the partitioning, when the normal slicestarts from a position other than a beginning of a first tile, the imageis partitioned into the tiles and the slices to prevent a second tilecoded next to the first tile from starting from the dependent slice.

With this, it is possible to prevent an occurrence of a case where aslice at the beginning of the second tile refers to a slice at aposition other than the beginning of the first tile, thereby increasingefficiency when parallel tile processing and dependent slices are usedtogether.

For example, in the partitioning, in the case where an image decodingapparatus decodes the first tile and the second tile in parallel, theimage may be partitioned into the tiles and the slices to allow thedecoding of the second tile without referring to partition informationwhen the image decoding apparatus starts decoding the second tile, thepartition information indicating a slice structure of the first tile.

For instance, in the partitioning, when a slice at a beginning of athird tile is the dependent slice, the image may be partitioned into thetiles and the slices to cause the dependent slice to include the wholethird tile.

For example, in the partitioning, when the first tile includes a slicestarting from a position other than the beginning of the first tile, theimage may be partitioned into the tiles and the slices to prevent thesecond tile from starting from the dependent slice.

For instance, the image coding method may further include embedding,into a slice header of a slice, information indicating whether the sliceis either the normal slice or the dependent slice.

For example, a slice at a beginning of the image may be the normalslice, and each of all other slices may be the dependent slice.

For instance, the image coding method may further include embedding,into the bitstream, a restriction indicator indicating that partitioningof a picture is restricted.

For example, the image coding method may further include embedding, intothe bitstream, an indicator indicating whether or not a parent slicewhose slice header is used for the dependent slice starts from abeginning of a tile.

According to an exemplary embodiment disclosed herein, an image decodingapparatus which decodes a bitstream including a coded signal resultingfrom coding tiles and slices into which an image is partitioned, theapparatus comprising a decoding unit configured to decode the codedsignal, wherein each of the slices is either a normal slice having, in aheader, information used for an other slice or a dependent slice whichis decoded using information included in a slice header of anotherslice, and when the normal slice starts from a position other than abeginning of a first tile, a second tile coded next to the first tiledoes not start from the dependent slice.

With this, it is possible to prevent an occurrence of a case where aslice at the beginning of the second tile refers to a slice at aposition other than the beginning of the first tile, thereby increasingefficiency when parallel tile processing and dependent slices are usedtogether.

According to an exemplary embodiment disclosed herein, an image codingapparatus which codes tiles and slices into which an image ispartitioned, to generate a bitstream, the apparatus comprising: apartitioning unit configured to partition the image into the tiles andthe slices; and a coding unit configured to code the tiles and slicesresulting from the partitioning, wherein each of the slices is either anormal slice having, in a header, information used for an other slice ora dependent slice which is decoded using information included in a sliceheader of another slice, and the partitioning unit configured to, whenthe normal slice starts from a position other than a beginning of afirst tile, partition the image into the tiles and the slices to preventa second tile coded next to the first tile from starting from thedependent slice.

With this, it is possible to prevent an occurrence of a case where aslice at the beginning of the second tile refers to a slice at aposition other than the beginning of the first tile, thereby increasingefficiency when parallel tile processing and dependent slices are usedtogether.

According to an exemplary embodiment disclosed herein, an image codingand decoding apparatus may include the image coding apparatus and theimage decoding apparatus.

Each of the exemplary embodiments described below shows a general orspecific example. The numerical values, shapes, materials, structuralelements, the arrangement and connection of the structural elements,steps, the processing order of the steps etc. shown in the followingexemplary embodiments are mere examples, and therefore do not limit thescope of the appended Claims and their equivalents. Therefore, among thestructural elements in the following exemplary embodiments, structuralelements not recited in any one of the independent claims showing mostgeneric concepts are described as arbitrary structural elements.

Embodiment 1

In an image coding method and an image decoding method according toEmbodiment 1, an indicator is added which clearly specifies CABACinitialization.

FIG. 12 is a diagram showing syntax of a slice header according toEmbodiment 1. A slice header 380 includes a row 381 having a new syntaxelement “entropy_default_initialization_flag.”

This entropy_deafult_initialization_flag is an indicator indicating,when set to a predetermined value, that CABAC of a slice is initializedwith a CABAC default (predetermined) value. The flag is an indicatorhaving the first value such as “1” indicating that a slice isinitialized with a CABAC value and the second value such as “0”indicating that the initialization is performed by another method. It isto be noted that the assignments of the values of “1” and “0” may beswitched.

The “other method” for determining initialization may be a predeterminedmethod such as initialization based on a value of a preceding slice.However, the “other method” may include another determination flowsimilar to the flow shown in FIG. 9, thereby possibly deriving aninitialization method using a default CABAC value.

An image decoding apparatus according to this embodiment decodes abitstream of a coded video sequence including image slices at leastpartially coded by arithmetic coding. The image decoding apparatusincludes: a parsing unit which extracts, from bitstream data of a slice,an initialization indicator indicating whether or not an arithmeticdecoding probability model of the slice is initialized with apredetermined value; a control unit which controls whether or not thearithmetic decoding probability model is initialized with thepredetermined value, according to the initialization indicator; anarithmetic decoding unit which decodes the slice.

For instance, the arithmetic coding may be context adaptive arithmeticcoding as defined in HEVC. However, the present disclosure is notlimited to this.

The predetermined value is a default value notified to an image codingapparatus and the image decoding apparatus, and does not change withcoded content.

The initialization indicator preferably refers to a 1-bit flag with “1”indicating that an arithmetic decoding probability model is initializedwith the predetermined value and “0” indicating that an arithmeticdecoding probability model is initialized by another method.

Only when a target slice is a dependent slice, the indicator needs to bepresent. This is because when the target slice is a normal slice, theCABAC default value is used for initialization (refer to the case of Noin S101 in FIG. 9). Thus, it is first analyzed whether or not the targetslice is the dependent slice by checking a conditiondependent_slice_flag==1.

Moreover, when parallel processing of a slice and another slice isperformed, the initialization indicator (flag) is advantageous. Forexample, the parallel processing may be the WPP. Thus, only when acondition entropy_coding_sync_enabled_flag==1 is true, the syntax of theslice header shown in FIG. 12 includes an initialization indicatorentropy_default_initialization_flag.

Furthermore, only when the slice starts at the beginning of an LCU row,the initialization indicator is appropriate. This is because immediateinitialization of CABAC is only then required to allow the parallelprocessing. This is indicated by a condition slice_address %PicWidthInCtbsY==0 in the syntax shown in FIG. 12.

As stated above, a syntax element “slice_address” indicates a start ofthe slice with an offset included in the bitstream. “PicWidthInCtbsY”indicates a width of a frame with the number of units of coding treeblocks (LCUs).

As shown in the row 381, a logical product of the three conditions isused for determination. In other words, only when Equation 2 below istrue, entropy_default_initialization_flag is transmitted to clearlysignal the initialization method.dependent_slice_flag==1&& entropy_coding_sync_enabled_flag==1&slice_address % PicWidthInCtibsY==0  (Equation 2)

When Equation 2 is not true, the initialization is performed based on anormal method, that is, WPP rules.

To put it another way, the image coding method and the image decodingmethod according to this embodiment include: subdividing a slice of animage into coding units corresponding to pixel blocks of the image; andextracting, by the parsing unit, an initialization indicator of headerdata, only when the slice is a dependent slice. An arithmetic decodingunit of dependent slices is initialized based on a context of anarithmetic decoding unit of parent slices corresponding to therespective dependent slices.

Moreover, only when parallel decoding of a row composed of the codingunits is allowed, the parsing unit may extract the initializationindicator of the header data.

Stated differently, according to this embodiment, the slice of the imageis subdivided into the coding units corresponding to the pixel blocks ofthe image, and the initialization indicator of the header data isextracted by the parsing unit only when the slice starts from thebeginning of the row composed of the coding unit blocks of the image.

FIG. 13 is a flow chart for a CABAC initialization determination methodfor a slice according to this embodiment. FIG. 13 assumes a case of thepicture 350 shown in FIG. 8. Assuming that the slice (4) (slice 354) andthe slice (1) (slice 351) are parsed in parallel, the followingdetermination is made.

First, it is determined whether or not the slice (4) is a dependentslice (S111). When the slice (4) is the dependent slice and otherconditions (parallel processing of rows is performed and a slice startsat the beginning of an LCU row) are satisfied (Yes in S111), aninitialization indicator “entropy_default_initialization_flag” ischecked to determine an initialization execution method (S112).

When the entropy_default_initialization_flag indicates application ofdefault initialization (No in S112), the default initialization isapplied (S114). In contrast, when theentropy_default_initialization_flag does not indicate the application ofthe default initialization (Yes in S112), initialization of the WPP isapplied in which a preceding slice is referred to (S113).

It is to be noted that this embodiment is not limited to signaling theinitialization indicator in the slice header. The same indicator may beembedded in another data structure, e.g. a supplemental enhancementinformation message.

Embodiment 2

Embodiment 1 makes it possible to achieve efficient parallel LCU rowprocessing such as the WPP and the dependent slice. On the other hand, anew syntax element is embedded in a slice header. In response,independence of CABAC initialization for slices during parallelprocessing may be achieved by modifying initialization rules, to avoidaddition of the new syntax element.

In Embodiment 2, the definition of the dependent slice and operationsfor dependent slice by an image coding apparatus and an image decodingapparatus are modified. This can be achieved by adding restrictions tobitstream standards.

In other words, the image decoding apparatus according to thisembodiment decodes a bitstream of a coded video sequence including imageslices subdivided into coding units and at least partially coded byarithmetic coding. The image decoding apparatus includes a parsing unitwhich extracts, from a bitstream, a first row of coding units and asecond row of coding units, wherein the coding units of the first rowand the second row are assigned to slices to avoid referring topartition information of a first slice in the first row when anarithmetic decoding unit for a second slice in the second row isinitialized. A start position of the first slice in the first row isbehind the second slice in the second row by a predetermined number ofcoding units. The image decoding apparatus further includes thearithmetic decoding unit which performs arithmetic decoding of the firstslice and the second slice at least partially in parallel, to decodeeach of the slices.

FIG. 14 is a diagram for describing the function of this embodiment, andshowing a picture 390 partitioned into slices. The picture 390 includesfour slices that are a normal slice 391, a normal slice 392, a dependentslice 393, and a normal slice 394.

The three slices 391, 392, and 393 are included in the first row ofcoding units (LCUs). The slice 394 includes the whole second and thirdrows.

The first exemplary restriction applied to slicing and parallelprocessing on a row basis is that “when entropy_code_sync_enabled_flagand dependent_slice_enabled_flag are equal to 1, a normal slice maystart only at the beginning of a row of coding tree blocks.” Inaddition, the both flags, the entropy_code_sync_enabled_flag and thedependent_slice_enabled_flag, are included in a picture parameter set.It is to be noted that a coding tree block (CTB) and a largest codingunit (LCU) refer to the same unit. The CTB is used in a standard text(refer to NPL 3). In addition, although the LCU is used in a standardtext of the previous version, the CTB is used in a standard text of thecurrent version.

When the normal slice starts only at the beginning of a row of codingunits, a dependent slice in another row which is subsequent to thenormal slice may always refer to CABAC states of the normal slice. Here,the CABAC states are CABAC states after the first LCU or the first twoLCUs are processed by the WPP. In addition, since a header of thedependent slice depends on a header of the normal slice preceding thedependent slice, when the normal slice 394 is lost, it is necessary todiscard the dependent slice.

The first exemplary restriction does not need to be strict. It is onlynecessary to make at least one or two LCUs of the normal slice in apreceding row available to the dependent slice, to allow application ofWPP initialization.

Alternatively, the second exemplary restriction may be applied asanother restriction (rule). In the second exemplary restriction, anormal slice does not start after the second coding tree block in a rowof coding tree blocks. The normal slice has to start at the beginning ofan LCU row, and thus, for example, it is not acceptable to set thesecond slice 392 as the normal slice as shown in FIG. 14.

It is to be noted that the first slice may have a start position no morebehind than the second coding unit in the first row. Moreover, the firstslice may be a normal slice, and the second slice may be a dependentslice using a slice header of the normal slice. Furthermore, the startposition of the first slice may be the beginning of the first row.

FIG. 15 is a flow chart for a determination process in a CABACinitialization method when the above rules are set. The followingdescribes the determination process using the example shown in FIG. 8.

First, it is determined whether or not the slice (4) is a dependentslice (S111). When the slice (4) is the dependent slice (Yes in S111),WWP initialization is performed (S113). In contrast, when the slice (4)is not the dependent slice (No in S111), default initialization isperformed (S114).

As described above, a context adaptive entropy coding unit is used in animage coding method according to this embodiment. The image codingmethod is applied to a picture frame partitioned into at least twoportions. The at least two portions are a first portion and a secondportion which can be at least partially coded and decoded in parallel.

According to this embodiment, initialization of a context table of thesecond portion of a stream is determined, when the first portion of asubstream is subdivided into slices, by a method that does not depend onthe subdivision of the first portion. For instance, the WPP is performedfor each row (each LCU row), and thus a portion of the stream maycorrespond to the LCU row.

It is to be noted that the present disclosure is not limited to theabove exemplary restrictions. The exemplary restrictions may beformulated in a different manner. The following describes otherexemplary restrictions.

When a normal slice satisfies a condition of Equation 3, a slicestarting at the beginning of a subsequent LCU row is not a dependentslice.slice_address % PicWidthInCtbsY>1  (Equation 3)

For the sake of shorthand, the condition may be represented by Equation4.slice_address % PicWidthInCtbsY !=0  (Equation 4)

Here, “!=” indicates inequality. When entropy_coding_sync_enabled_flagis equal to 1, that is, parallel processing of an LCU row is allowed,these restrictions are applicable. Moreover, “slice_address” indicates aposition of a slice starting in a bitstream, and the parameter“PicWidthInCtbsY” indicates a width of a picture (frame) in an LCU(coding tree block).

To put it another way, when the normal slice does not start at thebeginning of the row, a slice starting in an immediately subsequent rowis not a dependent slice (third exemplary restriction). This conditioneliminates the need for waiting decoding of a slice in the second rowuntil a normal slice at a position in the first row is parsed (decoded).

The following describes the influence of the third exemplary restrictionwith reference to FIG. 16. A picture 400 shown in FIG. 16 includes threeslices 401 to 403 included in the first row. Among the three slices, thefirst two slices 401 and 402 are normal slices, and the third slice 403is a dependent slice.

This condition does not allow setting of the fourth slice 404 as thedependent slice. This is indicated in FIG. 16 by marking a cross to theslice 404.

Thus, the bitstream may include normal slices and dependent slices, anddecoding of the normal slices and the dependent slices is based onparameters signaled in slice headers of the normal slices. When a normalslice starts at a position after the beginning of an LCU row, the nextLCU row does not start with a dependent slice.

The following describes the fourth exemplary restriction with referenceto FIG. 17. When entropy_coding_sync_enabled_flag anddependent_slice_enabled_flag are equal to 1, no normal slice other thanthe first slice in a frame is allowed (fourth exemplary restriction).

Stated differently, when parallel processing is allowed and dependentslices are enabled, a normal slice is allowed only as the first slice inthe frame. In short, all the slices in the frame are the dependentslices except the first slice.

A picture 410 shown in FIG. 17 includes five slices 411 to 415. Theslices 411, 412, and 415 are normal slices, and the slices 413 and 414are dependent slices. The normal slices 412 to 415 are not allowedexcept the first normal slice 411 according to the fourth exemplaryrestriction. In short, the slices 412 and 415 have to be the dependentslices.

It is to be noted that the usage of the fourth exemplary restrictioncauses a demerit regarding robustness against packet loss. The normalslices are usually used to reduce a dependency or error propagation in alossy environment. A frame where only the first slice is the normalslice assumes a risk that all slices cannot be decoded when the firstslice cannot be decoded.

Moreover, the following restriction may be used as another restriction.When a slice (normal or dependent slice) starts in the middle of an LCUrow (i.e., a position different from the beginning of the row), the nextrow of coding units does not start with a dependent slice (fifthexemplary restriction).

It is to be noted that as is clear to a person skilled in the art, it ispossible to arbitrarily combine the restrictions described above. Inother words, the first to fifth exemplary restrictions may be applied incombination.

The following further describes another exemplary restriction. Whenentropy_coding_sync_enabled_flag is equal to 1, one LCU row cannot besubdivided into slices (sixth exemplary restriction). When thisrestriction is applied, the slices 412 and 413 are not allowed in theslice structure shown in FIG. 17. To put it another way, when parallelprocessing of rows of coding units is allowed, a slice is allowed onlyto include one whole row of coding units or whole rows of coding units.

As stated above, the bitstream includes the normal slices and thedependent slices. The decoding of the normal slices and the dependentslices is based on the parameters signaled in the slice headers of thenormal slices. After it is determined that only the first slice in animage would be a normal slice and remaining slices would be dependentslices, the image is partitioned into slices.

Each of the slices includes all of an m number of rows of coding units.Here, m is an integer greater than or equal to 1.

When the dependent slices are enabled and one of the WPP and tile isenabled in addition to or instead of the application of the restriction,an indicator indicating the restriction may be embedded in thebitstream. For instance, this indicator is embedded in an SPS or a PPS.It is to be noted that the indicator may be embedded in another messagesuch as an SEI message or in any video usability information (VUI)message.

The image decoding apparatus identifies a restriction to be applied,based on the indicator. For example, this restriction is that a normalslice is allowed only at the beginning of an LCU row (WPP) or a tile. Itis to be noted that this is merely an exemplary restriction, and any ofthe above-mentioned restrictions, a combination of the restrictions, oran additional restriction not explicitly described may be applied.

For instance, the indicator may be a 1-bit flag indicating, for apredetermined restriction, whether or not the restriction is to beapplied. Selectable restrictions may be available, and informationindicating a selected restriction is signaled in the bitstream to theimage decoding apparatus. Stated differently, instead of explicitlylimiting the usage as described in the above examples, the image codingapparatus may notify the image decoding apparatus that such restrictionsare used. Thus, any of the examples regarding the restrictions can beapplied.

It is to be noted that it is not necessary to determine whether or notto add the indicator depending on whether or not the WPP or tile isenabled.

As described above, this embodiment makes it possible to prevent thedependent slice processing from being delayed by at least two or atleast three coding units, by the CABAC initialization in view of thepreceding slices in the parallel processing. With this, the parallelprocessing of coding, decoding, and parsing of the rows can beefficiently performed.

It is to be noted that the present disclosure is not limited by thisembodiment in which the slicing method is limited. In addition, therestriction may relate to a slice from which a CABAC context can beobtained.

Embodiment 3

In Embodiment 3, a CABAC initialization method for a dependent slice ata time of WPP is changed. Specifically, the parent slice assignment rulefor the dependent slice is changed.

For instance, a rule is determined in which a dependent slice alwaysobtains a slice header and a CABAC context from the same sliceregardless of subdivision of an LCU row into slices (and/or a type of asubsequent slice).

A picture 420 shown in FIG. 18 includes slices 421 to 424. In currentHEVC, the slice 422 is a parent slice of the dependent slice 424. Inother words, a slice header of the dependent slice 424 is obtained fromthe slice 422, a closest preceding normal slice.

As described with reference to FIG. 9, there is a case where CABACinitialization is performed on the dependent slice using a normal sliceat the beginning of a preceding LCU row. However, when the slice 422 islost, although the CABAC initialization can be performed on the slice424, the slice 424 cannot be decoded due to the absent of slice headerinformation.

In view of this, in this embodiment, the dependent slice has, as theparent slice, a closest normal slice starting from the same row as thedependent slice or a row preceding the row of the dependent slice. Inthis embodiment, as shown in FIG. 19, the parent slice of the slice 424is set as the slice 421 according to this rule. The CABAC initializationis performed on the dependent slice 424 using a slice header of theslice 421 as well as CABAC states of the slice 421.

In addition, an arithmetic coding unit of each dependent slice sets aslice dependency to perform initialization based on a context of anarithmetic decoding unit of the parent slice.

It is to be noted that information indicating a CABAC context table usedfor slice initialization may be explicitly signaled in an SEI message.In short, all initialization values considered to be used for CABACengine initialization may be explicitly signaled in the SEI message.

Embodiment 4

Embodiment 4 describes a case where not the WPP but tiles are used.

The problem described above for the WPP also occurs in such a case.However, CABAC context table initialization denotes setting a CABACcontext table to either a default initial value or a previously storedvalue. In the case of a tile, (even when the tile starts with adependent slice) the CABAC context table is initialized to a defaultvalue at the beginning of the tile.

However, when a normal slice is present in the middle of the tile, someof syntax elements included in a slice header of the normal slice needto be modified. One of the syntax elements is a flag indicating ON/OFFof sample adaptive offset processing, for instance. When the flagindicates “ON,” a CABAC engine filters parameters while parsing slicedata. As above, this relates to state control of the CABAC engine. Thefollowing describes the state control in detail below.

FIG. 19 is a diagram showing syntax of a slice header according to thisembodiment. This slice header includes dependent_slice_flag, anindicator relating to a dependency.

FIG. 20 is a diagram showing a picture 500 partitioned into two tiles501 and 502. As shown in FIG. 20, the tiles differ from slices inpartitioning a picture with a vertical line. A picture can be normallypartitioned into tiles. Partition information of each of the tiles issignaled in a picture parameter set (PPS) relating to the picture. Asstated above, the tile is one of the tools which enable the parallelprocessing. In short, the tiles may be decoded in parallel. It is to benoted that loop filter processing is usually performed lastly at tileboundaries after tile reconstruction.

The picture parameter set includes information about the number andpositions of tiles in a picture. The tiles are similar to the slices inthat spatial prediction between tiles is not allowed. Here, the “spatialprediction” denotes intra-prediction, motion vector prediction, orreferring to a parameter. Here, the parameter refers to a sampleadaptive offset parameter, another parameter relating to a picture, or aparameter relating to another tile.

An entropy coding unit and an entropy decoding unit are restarted at thebeginning of each tile.

FIG. 21A is a diagram showing a processing order of coding units such ascoding tree blocks and largest coding units. This order is also referredto as Z scan or raster scan. FIG. 21A shows a case where no tile isenabled. In other words, FIG. 21A shows a case where one tile is set perpicture. It is to be noted that the WPP may be enabled.

FIG. 21B is a diagram showing a frame including two tiles 511 and 512resulting from partitioning the frame with a boundary 513. A processingorder when two or more tiles are present in a frame is determined asfollows.

First, an order of all tiles is determined by a normal raster scan orderdescribed above for the LCUs. This order starts from the tile 511 andends at the title 512 as shown in FIG. 21B.

Next, an order of LCUs in each tile is determined using the normalraster scan order as shown by arrows in FIG. 21B. Finally, the last LCUin each title is connected to the first LCU in a subsequent title. Inthis way, the order shown in FIG. 21B is determined. It is to be notedthat, for example, NPL 3 describes the details of the processing order.

An LCU scan order is used for the slices. Thus, when a slice A precedesa slice B in coding order, all LCUs in the slice A precede all LCUs inthe slice B.

On the other hand, when the tiles are used, the coding units are scannedin an order different from the order applied when only the slices areused (no tile is used). Specifically, when only the slices are used,coding units in a picture are scanned by the so-called Z scan. The Zscan starts from the upper left coding unit in the picture, continuesalong the first row rightward, and starts from the coding unit at theleft end of the second row to the coding unit at the right end of thesecond row after the right end of the first row is scanned. The scancontinues to the last coding unit in the last row in such an order.

When the slices are used as consecutive coding units in the Z scanorder, this usage is efficient. However, when the tiles are used as thesame, coding or decoding order of the coding units is changed from the Zscan order. Specifically, scanning is performed in each tile in the Zscan order. In short, the scanning in the Z scan order is neverperformed over the tiles. Thus, the coding or decoding of the codingunits in the tile starts from the upper left coding unit in the tile andends at the lower right coding unit in the same. In addition, the tilesin the picture are ordered in the Z scan order as above.

In the current HEVC standard, a restriction regarding the usage of tilesand slices in combination is placed. Specifically, a slice is onlyallowed to include an integer number of complete tiles. In addition, atile is only allowed to include an integer number of complete slices.

A syntax element tiles_enabled_flag is included as part of a sequenceparameter set (SPS) in syntax of a bitstream. Setting this syntaxelement to a logical value “1” enables the usage of tiles.

When the tiles are used, the WPP cannot be used. Thus, when the tilesare used, a syntax element entropy_coding_sync_enabled_flag of the SPSfor controlling the usage of the WPP is set to a logical value “0.”

Each of FIG. 22A to FIG. 22C is a diagram for illustrating a restrictionwhen tiles and slices are used simultaneously. As shown in FIG. 22A, aslice is allowed to be subdivided into two tiles. In this example, aslice (1) includes a whole picture and is subdivided into two tileshaving the same size.

In an example shown in FIG. 22B, a picture is partitioned into twotiles. In addition, each of the tiles is subdivided into two slices.Specifically, the picture is partitioned into a tile 1 and a tile 2. Thetile 1 and the tile 2 includes the left half and the right half of thepicture, respectively. The title 1 is subdivided into two slices, aslice 1 and a slice 2, and the tile 2 is subdivided into two slices, aslice 3 and a slice 4.

FIG. 22C is a diagram showing a non-allowed slice and tile structure. Inthis example, a slice 1 is included in both a tile 1 and a tile 2. Incontrast, a slice 2 is present only in the tile 2. Thus, neither thetile 1 nor the tile 2 includes an integer number of complete tiles.Similarly, neither the slice 1 nor the slice 2 includes an integernumber of complete tiles.

These rules are applied to the simultaneous usage of slices and tiles.However, a case of using slices of different types is not considered inthe rules. To put it another way, it is not considered whether a sliceis a normal slice or a dependent slice.

FIG. 23 is a diagram showing an example of partitioning a picture intotiles and slices. This partitioning is allowed according to the aboverestrictions. The partitioning corresponds to the example shown in FIG.22B. Slices 521 and 522 included in a tile 1 are normal slices. Slices523 and 524 included in a tile 2 are dependent slices.

FIG. 24 is a diagram showing a scanning order when a single core is usedfor processing of coding units in a picture, especially for decoding orcoding of the coding units. As shown in FIG. 24, when tile subdivisionis not performed, the single core decodes the coding units in the Z scanorder.

However, a CABAC engine is re-initialized according to the definition oftiles, that is, tile boundaries. Stated differently, CABAC states at thetile boundaries need to be stored for later initialization. Thus, asingle core decoding order requires jumping in the bitstream. This isbecause the tile subdivision changes the coding order of the codingunits.

Moreover, when dependent slices are enabled, the single core decoding ismore complicated. The following exemplifies decoding of the picturepartitioned as shown in FIG. 23.

In the first step, the first coding unit row of the slice 521 isdecoded. In the second step, a slice address of the slice 522 isdecoded. The slice address is signaled in a slice header of the slice522. The slice address is expressed in the number of LCUs and indicatesa position in a bitstream at which a slice starts. In addition, theslice address is different from the first coding unit in the tile 2.

In the third step, the slice 523 is decoded. A slice address of thisslice is correct, but the slice is a dependent slice. Thus, the slice523 uses the slice header of the slice 522 in the tile 1. For thisreason, the decoding process jumps back to the slice 522, and the headerof the slice 522 is decoded. Then, the decoding process jumps forward toreturn to the decoding of the slice 523. Subsequently, the decoding ofthe slice 523 is started.

As is clear from this brief example, an image decoding apparatus needsto jump back and forth in the bitstream, and to perform an additionalcheck when decoding of the tile 2 is started.

This is because the usage of the dependent slices causes a dependencybetween the tiles.

In response, this embodiment achieves a method for allowing effectiveapplication of dependent slices and tiles. Specifically, this embodimentmakes it possible to surely perform appropriate coding and decoding in anormal order, by putting a restriction regarding partitioning of apicture into slices and tiles.

The image decoding apparatus according to this embodiment decodes abitstream of a coded video sequence including frames each includingimage slices and image tiles. Each of the image slices and the imagetiles includes coding units. The image decoding apparatus includes aparsing unit which extracts (parses), from a bitstream, a tile 1 and atile 2 coded next to the tile 1. Each of the frames is partitioned intoslices and tiles to eliminate the need for partition information of thetile 1 in decoding of the tile 2 by an arithmetic decoding unit.

The image decoding apparatus further includes the arithmetic decodingunit which decodes a slice by performing arithmetic decoding on the tile1 and the tile 2 at least partially in parallel.

Moreover, an image coding apparatus according to this embodiment codes,into a bitstream, a video including image slices each subdivided intocoding units, using at least partially arithmetic coding.

The image coding apparatus includes: a bitstream generating unit whichembeds a first tile and a second tile coded next to the first tile intothe bitstream; and an arithmetic coding unit which partitions each offrames into slices and tiles to eliminate the need for partitioninformation of the first tile when an arithmetic decoding unit decodesthe second tile, and which codes each of the slices by performingarithmetic coding on the first tile and the second tile at leastpartially in parallel.

In the first exemplary restriction of this embodiment, when the tilesare enabled and at the same time the dependent slices can be used, thenormal slice starts only at the beginning of the tile. In short, whentiles_enabled_flag is equal to 1 and at the same timedependent_slices_enabled_flag is equal to 1, each normal slice has tostart at the start position of a tile.

Here, the both the entropy_code_sync_enabled_flag and thedependent_slice_enabled_flag are included in a picture parameter set.

It is to be noted that when dependent_slices_enabled_flag is equal to 0,only the normal slices are used. With this, the above problem isavoided. This corresponds to the case where all the slices are thenormal slices in the picture shown in FIG. 22B.

As stated above, in the first exemplary restriction, the slice (normalslice) whose header is used for another slice always starts at thebeginning of the tile. In other words, the slice at the beginning of animage is the normal slice, and the other slices are the dependentslices. In short, the normal slice is only allowed as the slice at thebeginning of the image. In addition, slices other than the slice at thebeginning of the image are always the dependent slices. For instance, apicture shown in FIG. 25C is allowed, but a picture shown in FIG. 25B isnot allowed.

In the second exemplary restriction of this embodiment, when the tilesare enabled and the normal slice starts at the position other than thestart position of the tile, the tile to be coded next does not startwith the dependent slice. To put it another way, when tiles_enabled_flagis equal to 1 and slice_address is equal to a start address of a tile,the next tile does not start with the dependent slice.

Thus, as described with reference to FIG. 23, the process of jumpingback to the slice header of the normal slice 522 does not occur when thedependent slice 523 is decoded. In short, the slice 523 is not allowedas the dependent slice. This is because the normal slice 522 starts notat the start position of the tile but in the tile.

Consequently, in this embodiment, when the slice (normal slice) whoseheader is used for another slice does not start at the beginning of thetile, the tile coded next to the tile does not start from a slice(dependent slice) which is decoded using a header of an other slice.

Thus, in the second exemplary restriction, when the normal slice startsat the position other than the beginning of the first tile, the secondtile coded next to the first tile does not start with the dependentslice. Stated differently, when at least one of the second slice and asubsequent slice of the first tile is the normal slice, the slice at thebeginning of the second tile is the normal slice.

For example, as shown in FIG. 25A, when a slice (3) in a tile 1 ispresent, a slice (4) at the beginning of a tile 2 cannot be set as adependent slice. In addition, when at least one of a slice (2) and theslice (3) is a normal slice, the slice (4) cannot be set as thedependent slice. As a result, as shown in FIG. 25B, the slice (4) needsto be set as the normal slice. Moreover, in the second exemplaryrestriction, the picture shown in FIG. 25C is also allowed.

In the third exemplary restriction of this embodiment, when the tilestarts with the dependent slice, a complete tile is included in thedependent slice. In other words, when the tile starts from the slicewhich is decoded using a header of another slice, the whole tile isincluded in the slice.

Thus, in the third exemplary restriction, when the slice at thebeginning of the third tile is the dependent slice, the dependent sliceincludes the whole third tile. To put it another way, the third tileincludes only one dependent slice. For instance, as shown in FIG. 26A,when a tile 2 starts from a dependent slice (4), the tile 2 is notallowed to include slices. Thus, as shown in FIG. 26B, the tile 2 needsto include only one dependent slice (4).

In the fourth exemplary restriction of this embodiment, whentiles_enabled_flag is equal to 1 and the slice (normal slice ordependent slice) starts in the middle of the tile, the tile to be codednext does not start from the dependent slice. It is to be noted that thephrase “in the middle of the tile” denotes not the actual middle butthat the first CTB of a slice is not the first CTB of a tile. In short,the phrase “in the middle of the tile” denotes within a tile.

This means that when a slice does not start at the beginning of a tile,a tile to be coded next does not start from a slice which uses a headerof another slice. To put it another way, when the first tile includes aslice starting at a position other than the beginning of the first tile(first tile includes slices), the second tile does not start from adependent slice. For example, as shown in FIG. 27A, when a tile 1includes tiles, a slice (4) at the beginning of a tile 2 is not allowedto be set as the dependent slice. As a result, as shown in FIG. 27B, theslice (4) at the beginning of the tile 2 needs to be set as a normalslice.

It is to be noted that this embodiment relating to the tiles and theother embodiments can be combined, and particular rules and restrictionsmay be also combined.

In the other exemplary restriction of this embodiment, whentiles_enabled_flag is equal to 1, the dependent slice is not allowed.Stated differently, the dependent slices are allowed to be used with theWPP but not with the tiles. With this, an additional problem when thetiles are used can be avoided. In short, when the tiles are used, theslice does not use a header of another slice for decoding.

When the dependent slices are enabled and one of the WPP and tile isenabled in addition to or instead of the application of the restriction,an indicator indicating the restriction may be embedded in thebitstream. For instance, this indicator is embedded in an SPS or a PPS.It is to be noted that the indicator may be embedded in another messagesuch as an SEI message or in any video usability information (VUI)message.

The image decoding apparatus identifies a restriction to be applied,based on the indicator. For example, this restriction is that a normalslice may start only at the beginning of a tile (beginning of an LCU rowin the case of the WPP). It is to be noted that this is merely anexemplary restriction, and any of the above-mentioned restrictions, acombination of the restrictions, or an additional restriction notexplicitly described may be applied.

For instance, the indicator may be a 1-bit flag indicating, for apredetermined restriction, whether or not the restriction is to beapplied. Selectable restrictions may be available, and informationindicating a selected restriction is signaled in the bitstream to theimage decoding apparatus. Stated differently, instead of explicitlylimiting the usage as described in the above examples, the image codingapparatus may notify the image decoding apparatus that such restrictionsare used. Thus, any of the examples regarding the restrictions can beapplied.

According to an exemplary embodiment disclosed herein, an image decodingmethod includes obtaining, from a bitstream, a restriction indicatorindicating that partitioning of a picture is restricted. According to anexemplary embodiment disclosed herein, an image coding method includesembedding, into a bitstream, a restriction indicator indicating thatpartitioning of a picture is restricted.

It is to be noted that it is not necessary to determine whether or notto add the indicator depending on whether or not the WPP or tile isenabled. In addition, when the indicator is added, the dependent slicedoes not need to be enabled. In short, the indicator can be addedregardless of whether or not the usage of the dependent slice isenabled.

Moreover, an indicator which indicates that a parent slice of a targetslice starts at the beginning of a tile may be added to a bitstream. Inother words, according to an exemplary embodiment disclosed herein, animage decoding method includes obtaining, from a bitstream, an indicatorindicating whether or not a parent slice whose slice header is used fora dependent slice starts at the beginning of a tile. According to anexemplary embodiment disclosed herein, an image decoding method includesembedding, into a bitstream, an indicator indicating whether or not aparent slice whose slice header is used for a dependent slice starts atthe beginning of a tile.

Moreover, an indicator which indicates that all slices in a picture usethe same slice header may be added to a bitstream. In other words, thisindicator indicates that all syntax elements which are present in aheader of a normal slice and absent from a header of a dependent sliceare the same for all the slices in the picture.

Thus, a restriction indicator which indicates that partitioning of apicture is restricted by a predetermined rule may be included in abitstream.

Moreover, an indicator which indicates whether or not a parent slice ofa target slice starts at the beginning of a tile may be embedded into abitstream. Here, a header of the parent slice is used for the targetslice.

According to an exemplary embodiment disclosed herein, an image decodingmethod is an image decoding method for decoding a bitstream including acoded signal resulting from coding tiles and slices into which an imageis partitioned, the method including decoding the coded signal.According to an exemplary embodiment disclosed herein, an image codingmethod is an image coding method for generating a bitstream by codingtiles and slices into which an image is partitioned, the methodincluding: partitioning an image into tiles and slices; and coding thetiles and the slices resulting from the partition.

Each of the slices is either a normal slice or a dependent slice. Thenormal slice is a slice having, in a slice header, information likely tobe used for another slice. The dependent slice is a slice which isdecoded using information included in a slice header of another slice.Here, the other slice is, for instance, a normal slice preceding andbeing closest to the dependent slice.

In the partitioning, the image is partitioned into the tiles and theslices to satisfy one or more of the above-mentioned restrictions.

In the decoding, a first tile and a second tile may be decoded inparallel, and when decoding of the second tile is started, the secondtile may be decoded without referring to partition informationindicating a slice structure of the first tile. Moreover, in thepartitioning, when an image decoding apparatus decodes a first tile anda second tile in parallel, and when the image decoding apparatus startsdecoding the second tile, the image may be partitioned into the tilesand the slices to allow the decoding of the second tile withoutreferring to partition information indicating a slice structure of thefirst tile.

Here, the partition information is, for example, information indicatinga slice position (start position) or a position of a slice header. Theimage decoding apparatus jumps the target tile by referring to thepartition information.

As stated above, the slice header includes the information(dependent_slice_flag) indicating whether the slice is the normal sliceor the dependent slice. In other words, the image decoding methodincludes obtaining, from a slice header, information indicating whethera slice is a normal slice or a dependent slice. In addition, the imagecoding method includes embedding, into a slice header, informationindicating whether a slice is a normal slice or a dependent slice.

The same problem described for the WPP also occurs for the tiles. Thus,the above solution can be applied to the tiles. When the tiles areenabled in stead of the WPP, part on which parallel processing isperformed is not an LCU row but a tile composed of LCUs. To put itanother way, the solution can be directly applied to the tile byreplacing the LCU row with the tile.

As stated above, the bitstream may include the normal slices and thedependent slices, and the decoding of the normal slices and thedependent slices is based on the parameters signaled in the sliceheaders of the normal slices.

According to an exemplary embodiment disclosed herein, when a normalslice does not start at a start position of a tile, a restriction that adependent slice dependent on the normal slice cannot follow the normalslice is applied.

According to an exemplary embodiment disclosed herein, a restrictionthat an image is partitioned into slices is applied to cause only thefirst slice in the image to be a normal slice and the remaining slicesto be dependent slices.

The slice dependency is caused by the arithmetic decoding unit of eachdependent slice using a slice header of a parent slice.

According to an exemplary embodiment disclosed herein, when a dependentslice is applicable, a restriction indicator is embedded into abitstream. The dependent slice is a slice which includes coded imagedata and uses parameters of a header of another slice.

The restriction may be any of the above restrictions, a combination ofsuch restrictions, or a restriction other than the exemplaryrestrictions.

According to an exemplary embodiment disclosed herein, an apparatus isan apparatus which decodes a bitstream of a coded video sequenceincluding image slices and image tiles that are at least partially codedby arithmetic coding, the apparatus including: a parsing unit whichextracts, from data for a slice of the bitstream, an initializationindicator indicating whether or not an arithmetic decoding probabilitymodel of the slice is initialized with a predetermined value; a controlunit which controls whether or not the arithmetic decoding probabilitymodel is initialized with the predetermined value; and an arithmeticdecoding unit which decodes the slice by arithmetic decoding.

According to an exemplary embodiment disclosed herein, an apparatus isan apparatus which at least partially codes a video sequence includingimage slices by arithmetic coding, to generate a bitstream, theapparatus including: a bitstream generating unit which embeds, into datafor a slice of the bitstream, an initialization indicator indicatingwhether or not an arithmetic coding probability model of the slice isinitialized with a predetermined value; a control unit which controlswhether or not the arithmetic coding probability model is initializedwith the predetermined value; and an arithmetic coding unit which codesthe slice.

For instance, the initialization indicator is embedded into header dataof the slice.

For example, the initialization indicator is a 1-bit flag. In the 1-bitflag, “1” indicates that the arithmetic decoding probability mode isinitialized with the predetermined value, and “0” indicates that thearithmetic decoding probability mode is initialized by another method.

For instance, a slice of an image may be subdivided into coding unitscorresponding to pixel blocks of the image, and only when the slice is adependent slice that is a slice using parameters of a header of anotherslice, the parsing unit may extract an initialization indicator ofheader data.

For example, only when parallel decoding of tiles is allowed, theparsing unit may extract the initialization indicator of the headerdata. Alternatively, only when a slice starts at the beginning of atile, the parsing unit may extract the initialization indicator of theheader data.

For instance, the initialization indicator is embedded into an SEImessage outside of a slice header.

It is to be noted that the term “slice (normal slice or dependentslice)” used in the above description is sometimes referred to as a“slice segment (normal slice segment or dependent slice segment).” Inthis case, a unit including one or more consecutive slice segments isreferred to as a “slice.” Specifically, one slice includes one normalslice segment and one or more consecutive dependent slice segmentsfollowing the normal slice segment. Stated differently, when a normalslice segment immediately follows another normal slice segment, a sliceincludes only the normal slice segment. In addition, when one or moredependent slice segments immediately follow a normal slice segment, aslice includes the normal slice segment and the one or more dependentslice segments. In a word, one slice ranges from a normal slice segmentto one or more dependent slices immediately preceding the next normalslice segment.

When such a definition is used, the above-mentioned restrictions for thetiles and slices correspond to the following definitions.

One or both of the following conditions shall be fulfilled for eachslice and tile. (1) All coding tree units in a slice belong to the sametile. (2) All coding tree units in a tile belong to the same slice.

Here, the coding tree units are the same in meaning as theabove-mentioned LCUs and coding tree blocks.

In addition, one or both of the following conditions shall be fulfilledfor each slice segment and tile. (1) All coding tree units in a slicesegment belong to the same tile. (2) All coding tree units in a tilebelong to the same slice segment.

Although the image coding method and the image decoding method accordingto the embodiments have been described thus far, the present disclosureis not limited to the embodiments.

The image coding method and the image decoding method are performed bythe image coding apparatus and the image decoding apparatus,respectively. The image coding apparatus and the image decodingapparatus have the same structures as, for instance, those shown in FIG.1 and FIG. 2, respectively, and characteristics steps included in theimage coding method and the image decoding method are executed by any ofthe respective processing units shown in FIG. 1 and FIG. 2 or processingunits not shown.

Moreover, the respective processing units included in the image codingapparatus and the image decoding apparatus according to the embodimentsare typically implemented as an LSI which is an integrated circuit.These processing units may be individually configured as single chips ormay be configured so that a part or all of the processing units areincluded in a single chip.

Furthermore, the method of circuit integration is not limited to LSIs,and implementation through a dedicated circuit or a genera-purposeprocessor is also possible. A Field Programmable Gate Array (FPGA) whichallows programming after LSI manufacturing or a reconfigurable processorwhich allows reconfiguration of the connections and settings of thecircuit cells inside the LSI may also be used.

In the respective embodiments, the respective constituent elements areconfigured using dedicated hardware, but may also be implemented byexecuting software programs suited to the respective constituentelements. The respective constituent elements may be implemented throughthe reading and execution of a software program recorded on a recordingmedium such as a hard disk or semiconductor memory by a programexecution unit such as a CPU and a processor.

In other words, each of the image coding apparatus and the imagedecoding apparatus includes control circuitry and storage electricallyconnected to the control circuitry (accessible from the controlcircuitry). The control circuitry includes at least one of the dedicatedhardware and the program execution unit. In addition, when the controlcircuitry includes the program execution unit, the storage stores asoftware program executed by the program execution unit.

Moreover, the present disclosure may be the software program, or anon-transitory computer-readable recording medium on which the programis recorded. Furthermore, it goes without saying that the program can bedistributed via a transmission medium such as the Internet.

Moreover, all numerical figures used in the forgoing description aremerely exemplified for describing the present disclosure in specificterms, and thus the present disclosure is not limited to the exemplifiednumerical figures.

Furthermore, the separation of the function blocks in the block diagramsis merely an example, and plural function blocks may be implemented as asingle function block, a single function block may be separated intoplural function blocks, or part of functions of a function block may betransferred to another function block. In addition, the functions offunction blocks having similar functions may be processed, in parallelor by time-sharing, by single hardware or software.

Moreover, the sequence in which the steps included in the image codingmethod and the image decoding method are executed is given as an exampleto describe the present disclosure in specific terms, and thus othersequences are possible. Furthermore, part of the steps may be executedsimultaneously (in parallel) with another step.

The herein disclosed subject matter is to be considered descriptive andillustrative only, and the appended Claims are of a scope intended tocover and encompass not only the particular embodiments disclosed, butalso equivalent structures, methods, and/or uses. Various modificationsto the embodiments that can be conceived by those skilled in the art,and forms configured by combining constituent elements in differentembodiments without departing from the teachings of the presentdisclosure are included in the scope of one or more aspects of thepresent disclosure.

Embodiment 5

The processing described in each of embodiments can be simplyimplemented in an independent computer system, by recording, in arecording medium, a program for implementing the configurations of themoving picture coding method (image coding method) and the movingpicture decoding method (image decoding method) described in each ofembodiments. The recording media may be any recording media as long asthe program can be recorded, such as a magnetic disk, an optical disk, amagnetic optical disk, an IC card, and a semiconductor memory.

Hereinafter, the applications to the moving picture coding method (imagecoding method) and the moving picture decoding method (image decodingmethod) described in each of embodiments and systems using thereof willbe described. The system has a feature of having an image coding anddecoding apparatus that includes an image coding apparatus using theimage coding method and an image decoding apparatus using the imagedecoding method. Other configurations in the system can be changed asappropriate depending on the cases.

FIG. 28 illustrates an overall configuration of a content providingsystem ex100 for implementing content distribution services. The areafor providing communication services is divided into cells of desiredsize, and base stations ex106, ex107, ex108, ex109, and ex110 which arefixed wireless stations are placed in each of the cells.

The content providing system ex100 is connected to devices, such as acomputer ex111, a personal digital assistant (PDA) ex112, a cameraex113, a cellular phone ex114 and a game machine ex115, via the Internetex101, an Internet service provider ex102, a telephone network ex104, aswell as the base stations ex106 to ex110, respectively.

However, the configuration of the content providing system ex100 is notlimited to the configuration shown in FIG. 28, and a combination inwhich any of the elements are connected is acceptable. In addition, eachdevice may be directly connected to the telephone network ex104, ratherthan via the base stations ex106 to ex110 which are the fixed wirelessstations. Furthermore, the devices may be interconnected to each othervia a short distance wireless communication and others.

The camera ex113, such as a digital video camera, is capable ofcapturing video. A camera ex116, such as a digital camera, is capable ofcapturing both still images and video. Furthermore, the cellular phoneex114 may be the one that meets any of the standards such as GlobalSystem for Mobile Communications (GSM) (registered trademark), CodeDivision Multiple Access (CDMA), Wideband-Code Division Multiple Access(W-CDMA), Long Term Evolution (LTE), and High Speed Packet Access(HSPA). Alternatively, the cellular phone ex114 may be a PersonalHandyphone System (PHS).

In the content providing system ex100, a streaming server ex103 isconnected to the camera ex113 and others via the telephone network ex104and the base station ex109, which enables distribution of images of alive show and others. In such a distribution, a content (for example,video of a music live show) captured by the user using the camera ex113is coded as described above in each of embodiments (i.e., the camerafunctions as the image coding apparatus according to an aspect of thepresent disclosure), and the coded content is transmitted to thestreaming server ex103. On the other hand, the streaming server ex103carries out stream distribution of the transmitted content data to theclients upon their requests. The clients include the computer ex111, thePDA ex112, the camera ex113, the cellular phone ex114, and the gamemachine ex115 that are capable of decoding the above-mentioned codeddata. Each of the devices that have received the distributed datadecodes and reproduces the coded data (i.e., functions as the imagedecoding apparatus according to an aspect of the present disclosure).

The captured data may be coded by the camera ex113 or the streamingserver ex103 that transmits the data, or the coding processes may beshared between the camera ex113 and the streaming server ex103.Similarly, the distributed data may be decoded by the clients or thestreaming server ex103, or the decoding processes may be shared betweenthe clients and the streaming server ex103. Furthermore, the data of thestill images and video captured by not only the camera ex113 but alsothe camera ex116 may be transmitted to the streaming server ex103through the computer ex111. The coding processes may be performed by thecamera ex116, the computer ex111, or the streaming server ex103, orshared among them.

Furthermore, the coding and decoding processes may be performed by anLSI ex500 generally included in each of the computer ex111 and thedevices. The LSI ex500 may be configured of a single chip or a pluralityof chips. Software for coding and decoding video may be integrated intosome type of a recording medium (such as a CD-ROM, a flexible disk, anda hard disk) that is readable by the computer ex111 and others, and thecoding and decoding processes may be performed using the software.Furthermore, when the cellular phone ex114 is equipped with a camera,the video data obtained by the camera may be transmitted. The video datais data coded by the LSI ex500 included in the cellular phone ex114.

Furthermore, the streaming server ex103 may be composed of servers andcomputers, and may decentralize data and process the decentralized data,record, or distribute data.

As described above, the clients may receive and reproduce the coded datain the content providing system ex100. In other words, the clients canreceive and decode information transmitted by the user, and reproducethe decoded data in real time in the content providing system ex100, sothat the user who does not have any particular right and equipment canimplement personal broadcasting.

Aside from the example of the content providing system ex100, at leastone of the moving picture coding apparatus (image coding apparatus) andthe moving picture decoding apparatus (image decoding apparatus)described in each of embodiments may be implemented in a digitalbroadcasting system ex200 illustrated in FIG. 29. More specifically, abroadcast station ex201 communicates or transmits, via radio waves to abroadcast satellite ex202, multiplexed data obtained by multiplexingaudio data and others onto video data. The video data is data coded bythe moving picture coding method described in each of embodiments (i.e.,data coded by the image coding apparatus according to an aspect of thepresent disclosure). Upon receipt of the multiplexed data, the broadcastsatellite ex202 transmits radio waves for broadcasting. Then, a home-useantenna ex204 with a satellite broadcast reception function receives theradio waves. Next, a device such as a television (receiver) ex300 and aset top box (STB) ex217 decodes the received multiplexed data, andreproduces the decoded data (i.e., functions as the image decodingapparatus according to an aspect of the present disclosure).

Furthermore, a reader/recorder ex218 (i) reads and decodes themultiplexed data recorded on a recording medium ex215, such as a DVD anda BD, or (i) codes video signals in the recording medium ex215, and insome cases, writes data obtained by multiplexing an audio signal on thecoded data. The reader/recorder ex218 can include the moving picturedecoding apparatus or the moving picture coding apparatus as shown ineach of embodiments. In this case, the reproduced video signals aredisplayed on the monitor ex219, and can be reproduced by another deviceor system using the recording medium ex215 on which the multiplexed datais recorded. It is also possible to implement the moving picturedecoding apparatus in the set top box ex217 connected to the cable ex203for a cable television or to the antenna ex204 for satellite and/orterrestrial broadcasting, so as to display the video signals on themonitor ex219 of the television ex300. The moving picture decodingapparatus may be implemented not in the set top box but in thetelevision ex300.

FIG. 30 illustrates the television (receiver) ex300 that uses the movingpicture coding method and the moving picture decoding method describedin each of embodiments. The television ex300 includes: a tuner ex301that obtains or provides multiplexed data obtained by multiplexing audiodata onto video data, through the antenna ex204 or the cable ex203, etc.that receives a broadcast; a modulation/demodulation unit ex302 thatdemodulates the received multiplexed data or modulates data intomultiplexed data to be supplied outside; and amultiplexing/demultiplexing unit ex303 that demultiplexes the modulatedmultiplexed data into video data and audio data, or multiplexes videodata and audio data coded by a signal processing unit ex306 into data.

The television ex300 further includes: a signal processing unit ex306including an audio signal processing unit ex304 and a video signalprocessing unit ex305 that decode audio data and video data and codeaudio data and video data, respectively (which function as the imagecoding apparatus and the image decoding apparatus according to theaspects of the present disclosure); and an output unit ex309 including aspeaker ex307 that provides the decoded audio signal, and a display unitex308 that displays the decoded video signal, such as a display.Furthermore, the television ex300 includes an interface unit ex317including an operation input unit ex312 that receives an input of a useroperation. Furthermore, the television ex300 includes a control unitex310 that controls overall each constituent element of the televisionex300, and a power supply circuit unit ex311 that supplies power to eachof the elements. Other than the operation input unit ex312, theinterface unit ex317 may include: a bridge ex313 that is connected to anexternal device, such as the reader/recorder ex218; a slot unit ex314for enabling attachment of the recording medium ex216, such as an SDcard; a driver ex315 to be connected to an external recording medium,such as a hard disk; and a modem ex316 to be connected to a telephonenetwork. Here, the recording medium ex216 can electrically recordinformation using a non-volatile/volatile semiconductor memory elementfor storage. The constituent elements of the television ex300 areconnected to each other through a synchronous bus.

First, the configuration in which the television ex300 decodesmultiplexed data obtained from outside through the antenna ex204 andothers and reproduces the decoded data will be described. In thetelevision ex300, upon a user operation through a remote controllerex220 and others, the multiplexing/demultiplexing unit ex303demultiplexes the multiplexed data demodulated by themodulation/demodulation unit ex302, under control of the control unitex310 including a CPU. Furthermore, the audio signal processing unitex304 decodes the demultiplexed audio data, and the video signalprocessing unit ex305 decodes the demultiplexed video data, using thedecoding method described in each of embodiments, in the televisionex300. The output unit ex309 provides the decoded video signal and audiosignal outside, respectively. When the output unit ex309 provides thevideo signal and the audio signal, the signals may be temporarily storedin buffers ex318 and ex319, and others so that the signals arereproduced in synchronization with each other. Furthermore, thetelevision ex300 may read multiplexed data not through a broadcast andothers but from the recording media ex215 and ex216, such as a magneticdisk, an optical disk, and a SD card. Next, a configuration in which thetelevision ex300 codes an audio signal and a video signal, and transmitsthe data outside or writes the data on a recording medium will bedescribed. In the television ex300, upon a user operation through theremote controller ex220 and others, the audio signal processing unitex304 codes an audio signal, and the video signal processing unit ex305codes a video signal, under control of the control unit ex310 using thecoding method described in each of embodiments. Themultiplexing/demultiplexing unit ex303 multiplexes the coded videosignal and audio signal, and provides the resulting signal outside. Whenthe multiplexing/demultiplexing unit ex303 multiplexes the video signaland the audio signal, the signals may be temporarily stored in thebuffers ex320 and ex321, and others so that the signals are reproducedin synchronization with each other. Here, the buffers ex318, ex319,ex320, and ex321 may be plural as illustrated, or at least one buffermay be shared in the television ex300. Furthermore, data may be storedin a buffer so that the system overflow and underflow may be avoidedbetween the modulation/demodulation unit ex302 and themultiplexing/demultiplexing unit ex303, for example.

Furthermore, the television ex300 may include a configuration forreceiving an AV input from a microphone or a camera other than theconfiguration for obtaining audio and video data from a broadcast or arecording medium, and may code the obtained data. Although thetelevision ex300 can code, multiplex, and provide outside data in thedescription, it may be capable of only receiving, decoding, andproviding outside data but not the coding, multiplexing, and providingoutside data.

Furthermore, when the reader/recorder ex218 reads or writes multiplexeddata from or on a recording medium, one of the television ex300 and thereader/recorder ex218 may decode or code the multiplexed data, and thetelevision ex300 and the reader/recorder ex218 may share the decoding orcoding.

As an example, FIG. 31 illustrates a configuration of an informationreproducing/recording unit ex400 when data is read or written from or onan optical disk. The information reproducing/recording unit ex400includes constituent elements ex401, ex402, ex403, ex404, ex405, ex406,and ex407 to be described hereinafter. The optical head ex401 irradiatesa laser spot in a recording surface of the recording medium ex215 thatis an optical disk to write information, and detects reflected lightfrom the recording surface of the recording medium ex215 to read theinformation. The modulation recording unit ex402 electrically drives asemiconductor laser included in the optical head ex401, and modulatesthe laser light according to recorded data. The reproductiondemodulating unit ex403 amplifies a reproduction signal obtained byelectrically detecting the reflected light from the recording surfaceusing a photo detector included in the optical head ex401, anddemodulates the reproduction signal by separating a signal componentrecorded on the recording medium ex215 to reproduce the necessaryinformation. The buffer ex404 temporarily holds the information to berecorded on the recording medium ex215 and the information reproducedfrom the recording medium ex215. The disk motor ex405 rotates therecording medium ex215. The servo control unit ex406 moves the opticalhead ex401 to a predetermined information track while controlling therotation drive of the disk motor ex405 so as to follow the laser spot.The system control unit ex407 controls overall the informationreproducing/recording unit ex400. The reading and writing processes canbe implemented by the system control unit ex407 using variousinformation stored in the buffer ex404 and generating and adding newinformation as necessary, and by the modulation recording unit ex402,the reproduction demodulating unit ex403, and the servo control unitex406 that record and reproduce information through the optical headex401 while being operated in a coordinated manner. The system controlunit ex407 includes, for example, a microprocessor, and executesprocessing by causing a computer to execute a program for read andwrite.

Although the optical head ex401 irradiates a laser spot in thedescription, it may perform high-density recording using near fieldlight.

FIG. 32 illustrates the recording medium ex215 that is the optical disk.On the recording surface of the recording medium ex215, guide groovesare spirally formed, and an information track ex230 records, in advance,address information indicating an absolute position on the diskaccording to change in a shape of the guide grooves. The addressinformation includes information for determining positions of recordingblocks ex231 that are a unit for recording data. Reproducing theinformation track ex230 and reading the address information in anapparatus that records and reproduces data can lead to determination ofthe positions of the recording blocks. Furthermore, the recording mediumex215 includes a data recording area ex233, an inner circumference areaex232, and an outer circumference area ex234. The data recording areaex233 is an area for use in recording the user data. The innercircumference area ex232 and the outer circumference area ex234 that areinside and outside of the data recording area ex233, respectively arefor specific use except for recording the user data. The informationreproducing/recording unit 400 reads and writes coded audio, coded videodata, or multiplexed data obtained by multiplexing the coded audio andvideo data, from and on the data recording area ex233 of the recordingmedium ex215.

Although an optical disk having a layer, such as a DVD and a BD isdescribed as an example in the description, the optical disk is notlimited to such, and may be an optical disk having a multilayerstructure and capable of being recorded on a part other than thesurface. Furthermore, the optical disk may have a structure formultidimensional recording/reproduction, such as recording ofinformation using light of colors with different wavelengths in the sameportion of the optical disk and for recording information havingdifferent layers from various angles.

Furthermore, a car ex210 having an antenna ex205 can receive data fromthe satellite ex202 and others, and reproduce video on a display devicesuch as a car navigation system ex211 set in the car ex210, in thedigital broadcasting system ex200. Here, a configuration of the carnavigation system ex211 will be a configuration, for example, includinga GPS receiving unit from the configuration illustrated in FIG. 30. Thesame will be true for the configuration of the computer ex111, thecellular phone ex114, and others.

FIG. 33A illustrates the cellular phone ex114 that uses the movingpicture coding method and the moving picture decoding method describedin embodiments. The cellular phone ex114 includes: an antenna ex350 fortransmitting and receiving radio waves through the base station ex110; acamera unit ex365 capable of capturing moving and still images; and adisplay unit ex358 such as a liquid crystal display for displaying thedata such as decoded video captured by the camera unit ex365 or receivedby the antenna ex350. The cellular phone ex114 further includes: a mainbody unit including an operation key unit ex366; an audio output unitex357 such as a speaker for output of audio; an audio input unit ex356such as a microphone for input of audio; a memory unit ex367 for storingcaptured video or still pictures, recorded audio, coded or decoded dataof the received video, the still pictures, e-mails, or others; and aslot unit ex364 that is an interface unit for a recording medium thatstores data in the same manner as the memory unit ex367.

Next, an example of a configuration of the cellular phone ex114 will bedescribed with reference to FIG. 33B. In the cellular phone ex114, amain control unit ex360 designed to control overall each unit of themain body including the display unit ex358 as well as the operation keyunit ex366 is connected mutually, via a synchronous bus ex370, to apower supply circuit unit ex361, an operation input control unit ex362,a video signal processing unit ex355, a camera interface unit ex363, aliquid crystal display (LCD) control unit ex359, amodulation/demodulation unit ex352, a multiplexing/demultiplexing unitex353, an audio signal processing unit ex354, the slot unit ex364, andthe memory unit ex367.

When a call-end key or a power key is turned ON by a user's operation,the power supply circuit unit ex361 supplies the respective units withpower from a battery pack so as to activate the cell phone ex114.

In the cellular phone ex114, the audio signal processing unit ex354converts the audio signals collected by the audio input unit ex356 invoice conversation mode into digital audio signals under the control ofthe main control unit ex360 including a CPU, ROM, and RAM.

Then, the modulation/demodulation unit ex352 performs spread spectrumprocessing on the digital audio signals, and the transmitting andreceiving unit ex351 performs digital-to-analog conversion and frequencyconversion on the data, so as to transmit the resulting data via theantenna ex350. Also, in the cellular phone ex114, the transmitting andreceiving unit ex351 amplifies the data received by the antenna ex350 invoice conversation mode and performs frequency conversion and theanalog-to-digital conversion on the data. Then, themodulation/demodulation unit ex352 performs inverse spread spectrumprocessing on the data, and the audio signal processing unit ex354converts it into analog audio signals, so as to output them via theaudio output unit ex357.

Furthermore, when an e-mail in data communication mode is transmitted,text data of the e-mail inputted by operating the operation key unitex366 and others of the main body is sent out to the main control unitex360 via the operation input control unit ex362. The main control unitex360 causes the modulation/demodulation unit ex352 to perform spreadspectrum processing on the text data, and the transmitting and receivingunit ex351 performs the digital-to-analog conversion and the frequencyconversion on the resulting data to transmit the data to the basestation ex110 via the antenna ex350. When an e-mail is received,processing that is approximately inverse to the processing fortransmitting an e-mail is performed on the received data, and theresulting data is provided to the display unit ex358.

When video, still images, or video and audio in data communication modeis or are transmitted, the video signal processing unit ex355 compressesand codes video signals supplied from the camera unit ex365 using themoving picture coding method shown in each of embodiments (i.e.,functions as the image coding apparatus according to the aspect of thepresent disclosure), and transmits the coded video data to themultiplexing/demultiplexing unit ex353. In contrast, during when thecamera unit ex365 captures video, still images, and others, the audiosignal processing unit ex354 codes audio signals collected by the audioinput unit ex356, and transmits the coded audio data to themultiplexing/demultiplexing unit ex353.

The multiplexing/demultiplexing unit ex353 multiplexes the coded videodata supplied from the video signal processing unit ex355 and the codedaudio data supplied from the audio signal processing unit ex354, using apredetermined method. Then, the modulation/demodulation unit(modulation/demodulation circuit unit) ex352 performs spread spectrumprocessing on the multiplexed data, and the transmitting and receivingunit ex351 performs digital-to-analog conversion and frequencyconversion on the data so as to transmit the resulting data via theantenna ex350.

When receiving data of a video file which is linked to a Web page andothers in data communication mode or when receiving an e-mail with videoand/or audio attached, in order to decode the multiplexed data receivedvia the antenna ex350, the multiplexing/demultiplexing unit ex353demultiplexes the multiplexed data into a video data bit stream and anaudio data bit stream, and supplies the video signal processing unitex355 with the coded video data and the audio signal processing unitex354 with the coded audio data, through the synchronous bus ex370. Thevideo signal processing unit ex355 decodes the video signal using amoving picture decoding method corresponding to the moving picturecoding method shown in each of embodiments (i.e., functions as the imagedecoding apparatus according to the aspect of the present disclosure),and then the display unit ex358 displays, for instance, the video andstill images included in the video file linked to the Web page via theLCD control unit ex359. Furthermore, the audio signal processing unitex354 decodes the audio signal, and the audio output unit ex357 providesthe audio.

Furthermore, similarly to the television ex300, a terminal such as thecellular phone ex114 probably have 3 types of implementationconfigurations including not only (i) a transmitting and receivingterminal including both a coding apparatus and a decoding apparatus, butalso (ii) a transmitting terminal including only a coding apparatus and(iii) a receiving terminal including only a decoding apparatus. Althoughthe digital broadcasting system ex200 receives and transmits themultiplexed data obtained by multiplexing audio data onto video data inthe description, the multiplexed data may be data obtained bymultiplexing not audio data but character data related to video ontovideo data, and may be not multiplexed data but video data itself.

As such, the moving picture coding method and the moving picturedecoding method in each of embodiments can be used in any of the devicesand systems described. Thus, the advantages described in each ofembodiments can be obtained.

Furthermore, various modifications and revisions can be made in any ofthe embodiments in the present disclosure.

Embodiment 6

Video data can be generated by switching, as necessary, between (i) themoving picture coding method or the moving picture coding apparatusshown in each of embodiments and (ii) a moving picture coding method ora moving picture coding apparatus in conformity with a differentstandard, such as MPEG-2, MPEG-4 AVC, and VC-1.

Here, when a plurality of video data that conforms to the differentstandards is generated and is then decoded, the decoding methods need tobe selected to conform to the different standards. However, since towhich standard each of the plurality of the video data to be decodedconform cannot be detected, an appropriate decoding method cannot beselected.

In view of this, multiplexed data obtained by multiplexing audio dataand others onto video data has a structure including identificationinformation indicating to which standard the video data conforms. Thespecific structure of the multiplexed data including the video datagenerated in the moving picture coding method and by the moving picturecoding apparatus shown in each of embodiments will be hereinafterdescribed. The multiplexed data is a digital stream in the MPEG-2Transport Stream format.

FIG. 34 illustrates a structure of the multiplexed data. As illustratedin FIG. 34, the multiplexed data can be obtained by multiplexing atleast one of a video stream, an audio stream, a presentation graphicsstream (PG), and an interactive graphics stream. The video streamrepresents primary video and secondary video of a movie, the audiostream (IG) represents a primary audio part and a secondary audio partto be mixed with the primary audio part, and the presentation graphicsstream represents subtitles of the movie. Here, the primary video isnormal video to be displayed on a screen, and the secondary video isvideo to be displayed on a smaller window in the primary video.Furthermore, the interactive graphics stream represents an interactivescreen to be generated by arranging the GUI components on a screen. Thevideo stream is coded in the moving picture coding method or by themoving picture coding apparatus shown in each of embodiments, or in amoving picture coding method or by a moving picture coding apparatus inconformity with a conventional standard, such as MPEG-2, MPEG-4 AVC, andVC-1. The audio stream is coded in accordance with a standard, such asDolby-AC-3, Dolby Digital Plus, MLP, DTS, DTS-HD, and linear PCM.

Each stream included in the multiplexed data is identified by PID. Forexample, 0x1011 is allocated to the video stream to be used for video ofa movie, 0x1100 to 0x111F are allocated to the audio streams, 0x1200 to0x121F are allocated to the presentation graphics streams, 0x1400 to0x141F are allocated to the interactive graphics streams, 0x1B00 to0x1B1F are allocated to the video streams to be used for secondary videoof the movie, and 0x1A00 to 0x1A1F are allocated to the audio streams tobe used for the secondary audio to be mixed with the primary audio.

FIG. 35 schematically illustrates how data is multiplexed. First, avideo stream ex235 composed of video frames and an audio stream ex238composed of audio frames are transformed into a stream of PES packetsex236 and a stream of PES packets ex239, and further into TS packetsex237 and TS packets ex240, respectively. Similarly, data of apresentation graphics stream ex241 and data of an interactive graphicsstream ex244 are transformed into a stream of PES packets ex242 and astream of PES packets ex245, and further into TS packets ex243 and TSpackets ex246, respectively. These TS packets are multiplexed into astream to obtain multiplexed data ex247.

FIG. 36 illustrates how a video stream is stored in a stream of PESpackets in more detail. The first bar in FIG. 36 shows a video framestream in a video stream. The second bar shows the stream of PESpackets. As indicated by arrows denoted as yy1, yy2, yy3, and yy4 inFIG. 36, the video stream is divided into pictures as I pictures, Bpictures, and P pictures each of which is a video presentation unit, andthe pictures are stored in a payload of each of the PES packets. Each ofthe PES packets has a PES header, and the PES header stores aPresentation Time-Stamp (PTS) indicating a display time of the picture,and a Decoding Time-Stamp (DTS) indicating a decoding time of thepicture.

FIG. 37 illustrates a format of TS packets to be finally written on themultiplexed data. Each of the TS packets is a 188-byte fixed lengthpacket including a 4-byte TS header having information, such as a PIDfor identifying a stream and a 184-byte TS payload for storing data. ThePES packets are divided, and stored in the TS payloads, respectively.When a BD ROM is used, each of the TS packets is given a 4-byteTP_Extra_Header, thus resulting in 192-byte source packets. The sourcepackets are written on the multiplexed data. The TP_Extra_Header storesinformation such as an Arrival_Time_Stamp (ATS). The ATS shows atransfer start time at which each of the TS packets is to be transferredto a PID filter. The source packets are arranged in the multiplexed dataas shown at the bottom of FIG. 37. The numbers incrementing from thehead of the multiplexed data are called source packet numbers (SPNs).

Each of the TS packets included in the multiplexed data includes notonly streams of audio, video, subtitles and others, but also a ProgramAssociation Table (PAT), a Program Map Table (PMT), and a Program ClockReference (PCR). The PAT shows what a PID in a PMT used in themultiplexed data indicates, and a PID of the PAT itself is registered aszero. The PMT stores PIDs of the streams of video, audio, subtitles andothers included in the multiplexed data, and attribute information ofthe streams corresponding to the PIDs. The PMT also has variousdescriptors relating to the multiplexed data. The descriptors haveinformation such as copy control information showing whether copying ofthe multiplexed data is permitted or not. The PCR stores STC timeinformation corresponding to an ATS showing when the PCR packet istransferred to a decoder, in order to achieve synchronization between anArrival Time Clock (ATC) that is a time axis of ATSs, and an System TimeClock (STC) that is a time axis of PTSs and DTSs.

FIG. 38 illustrates the data structure of the PMT in detail. A PMTheader is disposed at the top of the PMT. The PMT header describes thelength of data included in the PMT and others. A plurality ofdescriptors relating to the multiplexed data is disposed after the PMTheader. Information such as the copy control information is described inthe descriptors. After the descriptors, a plurality of pieces of streaminformation relating to the streams included in the multiplexed data isdisposed. Each piece of stream information includes stream descriptorseach describing information, such as a stream type for identifying acompression codec of a stream, a stream PID, and stream attributeinformation (such as a frame rate or an aspect ratio). The streamdescriptors are equal in number to the number of streams in themultiplexed data.

When the multiplexed data is recorded on a recording medium and others,it is recorded together with multiplexed data information files.

Each of the multiplexed data information files is management informationof the multiplexed data as shown in FIG. 39. The multiplexed datainformation files are in one to one correspondence with the multiplexeddata, and each of the files includes multiplexed data information,stream attribute information, and an entry map.

As illustrated in FIG. 39, the multiplexed data information includes asystem rate, a reproduction start time, and a reproduction end time. Thesystem rate indicates the maximum transfer rate at which a system targetdecoder to be described later transfers the multiplexed data to a PIDfilter. The intervals of the ATSs included in the multiplexed data areset to not higher than a system rate. The reproduction start timeindicates a PTS in a video frame at the head of the multiplexed data. Aninterval of one frame is added to a PTS in a video frame at the end ofthe multiplexed data, and the PTS is set to the reproduction end time.

As shown in FIG. 40, a piece of attribute information is registered inthe stream attribute information, for each PID of each stream includedin the multiplexed data. Each piece of attribute information hasdifferent information depending on whether the corresponding stream is avideo stream, an audio stream, a presentation graphics stream, or aninteractive graphics stream. Each piece of video stream attributeinformation carries information including what kind of compression codecis used for compressing the video stream, and the resolution, aspectratio and frame rate of the pieces of picture data that is included inthe video stream. Each piece of audio stream attribute informationcarries information including what kind of compression codec is used forcompressing the audio stream, how many channels are included in theaudio stream, which language the audio stream supports, and how high thesampling frequency is. The video stream attribute information and theaudio stream attribute information are used for initialization of adecoder before the player plays back the information.

In the present embodiment, the multiplexed data to be used is of astream type included in the PMT. Furthermore, when the multiplexed datais recorded on a recording medium, the video stream attributeinformation included in the multiplexed data information is used. Morespecifically, the moving picture coding method or the moving picturecoding apparatus described in each of embodiments includes a step or aunit for allocating unique information indicating video data generatedby the moving picture coding method or the moving picture codingapparatus in each of embodiments, to the stream type included in the PMTor the video stream attribute information. With the configuration, thevideo data generated by the moving picture coding method or the movingpicture coding apparatus described in each of embodiments can bedistinguished from video data that conforms to another standard.

Furthermore, FIG. 41 illustrates steps of the moving picture decodingmethod according to the present embodiment. In Step exS100, the streamtype included in the PMT or the video stream attribute informationincluded in the multiplexed data information is obtained from themultiplexed data. Next, in Step exS101, it is determined whether or notthe stream type or the video stream attribute information indicates thatthe multiplexed data is generated by the moving picture coding method orthe moving picture coding apparatus in each of embodiments. When it isdetermined that the stream type or the video stream attributeinformation indicates that the multiplexed data is generated by themoving picture coding method or the moving picture coding apparatus ineach of embodiments, in Step exS102, decoding is performed by the movingpicture decoding method in each of embodiments. Furthermore, when thestream type or the video stream attribute information indicatesconformance to the conventional standards, such as MPEG-2, MPEG-4 AVC,and VC-1, in Step exS103, decoding is performed by a moving picturedecoding method in conformity with the conventional standards.

As such, allocating a new unique value to the stream type or the videostream attribute information enables determination whether or not themoving picture decoding method or the moving picture decoding apparatusthat is described in each of embodiments can perform decoding. Even whenmultiplexed data that conforms to a different standard is input, anappropriate decoding method or apparatus can be selected. Thus, itbecomes possible to decode information without any error. Furthermore,the moving picture coding method or apparatus, or the moving picturedecoding method or apparatus in the present embodiment can be used inthe devices and systems described above.

Embodiment 7

Each of the moving picture coding method, the moving picture codingapparatus, the moving picture decoding method, and the moving picturedecoding apparatus in each of embodiments is typically achieved in theform of an integrated circuit or a Large Scale Integrated (LSI) circuit.As an example of the LSI, FIG. 42 illustrates a configuration of the LSIex500 that is made into one chip. The LSI ex500 includes elements ex501,ex502, ex503, ex504, ex505, ex506, ex507, ex508, and ex509 to bedescribed below, and the elements are connected to each other through abus ex510. The power supply circuit unit ex505 is activated by supplyingeach of the elements with power when the power supply circuit unit ex505is turned on.

For example, when coding is performed, the LSI ex500 receives an AVsignal from a microphone ex117, a camera ex113, and others through an AVIO ex509 under control of a control unit ex501 including a CPU ex502, amemory controller ex503, a stream controller ex504, and a drivingfrequency control unit ex512. The received AV signal is temporarilystored in an external memory ex511, such as an SDRAM. Under control ofthe control unit ex501, the stored data is segmented into data portionsaccording to the processing amount and speed to be transmitted to asignal processing unit ex507. Then, the signal processing unit ex507codes an audio signal and/or a video signal. Here, the coding of thevideo signal is the coding described in each of embodiments.Furthermore, the signal processing unit ex507 sometimes multiplexes thecoded audio data and the coded video data, and a stream IO ex506provides the multiplexed data outside. The provided multiplexed data istransmitted to the base station ex107, or written on the recordingmedium ex215. When data sets are multiplexed, the data should betemporarily stored in the buffer ex508 so that the data sets aresynchronized with each other.

Although the memory ex511 is an element outside the LSI ex500, it may beincluded in the LSI ex500. The buffer ex508 is not limited to onebuffer, but may be composed of buffers. Furthermore, the LSI ex500 maybe made into one chip or a plurality of chips.

Furthermore, although the control unit ex501 includes the CPU ex502, thememory controller ex503, the stream controller ex504, the drivingfrequency control unit ex512, the configuration of the control unitex501 is not limited to such. For example, the signal processing unitex507 may further include a CPU. Inclusion of another CPU in the signalprocessing unit ex507 can improve the processing speed. Furthermore, asanother example, the CPU ex502 may serve as or be a part of the signalprocessing unit ex507, and, for example, may include an audio signalprocessing unit. In such a case, the control unit ex501 includes thesignal processing unit ex507 or the CPU ex502 including a part of thesignal processing unit ex507.

The name used here is LSI, but it may also be called IC, system LSI,super LSI, or ultra LSI depending on the degree of integration.

Moreover, ways to achieve integration are not limited to the LSI, and aspecial circuit or a general purpose processor and so forth can alsoachieve the integration. Field Programmable Gate Array (FPGA) that canbe programmed after manufacturing LSIs or a reconfigurable processorthat allows re-configuration of the connection or configuration of anLSI can be used for the same purpose. Such a programmable logic devicecan typically execute the moving picture coding method and the movingpicture decoding method described in each of the embodiments, by loadingor reading, from a memory, a program included in software or firmware.

In the future, with advancement in semiconductor technology, a brand-newtechnology may replace LSI. The functional blocks can be integratedusing such a technology. The possibility is that the present disclosureis applied to biotechnology.

Embodiment 8

When video data generated in the moving picture coding method or by themoving picture coding apparatus described in each of embodiments isdecoded, compared to when video data that conforms to a conventionalstandard, such as MPEG-2, MPEG-4 AVC, and VC-1 is decoded, theprocessing amount probably increases. Thus, the LSI ex500 needs to beset to a driving frequency higher than that of the CPU ex502 to be usedwhen video data in conformity with the conventional standard is decoded.However, when the driving frequency is set higher, the power consumptionincreases.

In view of this, the moving picture decoding apparatus, such as thetelevision ex300 and the LSI ex500 is configured to determine to whichstandard the video data conforms, and switch between the drivingfrequencies according to the determined standard. FIG. 43 illustrates aconfiguration ex800 in the present embodiment. A driving frequencyswitching unit ex803 sets a driving frequency to a higher drivingfrequency when video data is generated by the moving picture codingmethod or the moving picture coding apparatus described in each ofembodiments. Then, the driving frequency switching unit ex803 instructsa decoding processing unit ex801 that executes the moving picturedecoding method described in each of embodiments to decode the videodata. When the video data conforms to the conventional standard, thedriving frequency switching unit ex803 sets a driving frequency to alower driving frequency than that of the video data generated by themoving picture coding method or the moving picture coding apparatusdescribed in each of embodiments. Then, the driving frequency switchingunit ex803 instructs the decoding processing unit ex802 that conforms tothe conventional standard to decode the video data.

More specifically, the driving frequency switching unit ex803 includesthe CPU ex502 and the driving frequency control unit ex512 in FIG. 42.Here, each of the decoding processing unit ex801 that executes themoving picture decoding method described in each of embodiments and thedecoding processing unit ex802 that conforms to the conventionalstandard corresponds to the signal processing unit ex507 in FIG. 42. TheCPU ex502 determines to which standard the video data conforms. Then,the driving frequency control unit ex512 determines a driving frequencybased on a signal from the CPU ex502. Furthermore, the signal processingunit ex507 decodes the video data based on the signal from the CPUex502. For example, the identification information described inEmbodiment 6 is probably used for identifying the video data. Theidentification information is not limited to the one described inEmbodiment 6 but may be any information as long as the informationindicates to which standard the video data conforms. For example, whenwhich standard video data conforms to can be determined based on anexternal signal for determining that the video data is used for atelevision or a disk, etc., the determination may be made based on suchan external signal. Furthermore, the CPU ex502 selects a drivingfrequency based on, for example, a look-up table in which the standardsof the video data are associated with the driving frequencies as shownin FIG. 45. The driving frequency can be selected by storing the look-uptable in the buffer ex508 and in an internal memory of an LSI, and withreference to the look-up table by the CPU ex502.

FIG. 44 illustrates steps for executing a method in the presentembodiment. First, in Step exS200, the signal processing unit ex507obtains identification information from the multiplexed data. Next, inStep exS201, the CPU ex502 determines whether or not the video data isgenerated by the coding method and the coding apparatus described ineach of embodiments, based on the identification information. When thevideo data is generated by the moving picture coding method and themoving picture coding apparatus described in each of embodiments, inStep exS202, the CPU ex502 transmits a signal for setting the drivingfrequency to a higher driving frequency to the driving frequency controlunit ex512. Then, the driving frequency control unit ex512 sets thedriving frequency to the higher driving frequency. On the other hand,when the identification information indicates that the video dataconforms to the conventional standard, such as MPEG-2, MPEG-4 AVC, andVC-1, in Step exS203, the CPU ex502 transmits a signal for setting thedriving frequency to a lower driving frequency to the driving frequencycontrol unit ex512. Then, the driving frequency control unit ex512 setsthe driving frequency to the lower driving frequency than that in thecase where the video data is generated by the moving picture codingmethod and the moving picture coding apparatus described in each ofembodiment.

Furthermore, along with the switching of the driving frequencies, thepower conservation effect can be improved by changing the voltage to beapplied to the LSI ex500 or an apparatus including the LSI ex500. Forexample, when the driving frequency is set lower, the voltage to beapplied to the LSI ex500 or the apparatus including the LSI ex500 isprobably set to a voltage lower than that in the case where the drivingfrequency is set higher.

Furthermore, when the processing amount for decoding is larger, thedriving frequency may be set higher, and when the processing amount fordecoding is smaller, the driving frequency may be set lower as themethod for setting the driving frequency. Thus, the setting method isnot limited to the ones described above. For example, when theprocessing amount for decoding video data in conformity with MPEG-4 AVCis larger than the processing amount for decoding video data generatedby the moving picture coding method and the moving picture codingapparatus described in each of embodiments, the driving frequency isprobably set in reverse order to the setting described above.

Furthermore, the method for setting the driving frequency is not limitedto the method for setting the driving frequency lower. For example, whenthe identification information indicates that the video data isgenerated by the moving picture coding method and the moving picturecoding apparatus described in each of embodiments, the voltage to beapplied to the LSI ex500 or the apparatus including the LSI ex500 isprobably set higher. When the identification information indicates thatthe video data conforms to the conventional standard, such as MPEG-2,MPEG-4 AVC, and VC-1, the voltage to be applied to the LSI ex500 or theapparatus including the LSI ex500 is probably set lower. As anotherexample, when the identification information indicates that the videodata is generated by the moving picture coding method and the movingpicture coding apparatus described in each of embodiments, the drivingof the CPU ex502 does not probably have to be suspended. When theidentification information indicates that the video data conforms to theconventional standard, such as MPEG-2, MPEG-4 AVC, and VC-1, the drivingof the CPU ex502 is probably suspended at a given time because the CPUex502 has extra processing capacity. Even when the identificationinformation indicates that the video data is generated by the movingpicture coding method and the moving picture coding apparatus describedin each of embodiments, in the case where the CPU ex502 has extraprocessing capacity, the driving of the CPU ex502 is probably suspendedat a given time. In such a case, the suspending time is probably setshorter than that in the case where when the identification informationindicates that the video data conforms to the conventional standard,such as MPEG-2, MPEG-4 AVC, and VC-1.

Accordingly, the power conservation effect can be improved by switchingbetween the driving frequencies in accordance with the standard to whichthe video data conforms. Furthermore, when the LSI ex500 or theapparatus including the LSI ex500 is driven using a battery, the batterylife can be extended with the power conservation effect.

Embodiment 9

There are cases where a plurality of video data that conforms todifferent standards, is provided to the devices and systems, such as atelevision and a cellular phone. In order to enable decoding theplurality of video data that conforms to the different standards, thesignal processing unit ex507 of the LSI ex500 needs to conform to thedifferent standards. However, increase in the scale of the circuit ofthe LSI ex500 and increase in the cost arise with the individual use ofthe signal processing units ex507 that conform to the respectivestandards.

In view of this, what is conceived is a configuration in which thedecoding processing unit for implementing the moving picture decodingmethod described in each of embodiments and the decoding processing unitthat conforms to the conventional standard, such as MPEG-2, MPEG-4 AVC,and VC-1 are partly shared. Ex900 in FIG. 46A shows an example of theconfiguration. For example, the moving picture decoding method describedin each of embodiments and the moving picture decoding method thatconforms to MPEG-4 AVC have, partly in common, the details ofprocessing, such as entropy coding, inverse quantization, deblockingfiltering, and motion compensated prediction. The details of processingto be shared probably include use of a decoding processing unit ex902that conforms to MPEG-4 AVC. In contrast, a dedicated decodingprocessing unit ex901 is probably used for other processing which isunique to an aspect of the present disclosure and does not conform toMPEG-4 AVC. Since the aspect of the present disclosure is characterizedby partitioning of a picture in particular, for example, the dedicateddecoding processing unit ex901 is used for the partitioning of apicture. Otherwise, the decoding processing unit is probably shared forone of the inverse quantization, entropy decoding, deblocking filtering,and motion compensation, or all of the processing. The decodingprocessing unit for implementing the moving picture decoding methoddescribed in each of embodiments may be shared for the processing to beshared, and a dedicated decoding processing unit may be used forprocessing unique to that of MPEG-4 AVC.

Furthermore, ex1000 in FIG. 46B shows another example in that processingis partly shared. This example uses a configuration including adedicated decoding processing unit ex1001 that supports the processingunique to an aspect of the present disclosure, a dedicated decodingprocessing unit ex1002 that supports the processing unique to anotherconventional standard, and a decoding processing unit ex1003 thatsupports processing to be shared between the moving picture decodingmethod according to the aspect of the present disclosure and theconventional moving picture decoding method. Here, the dedicateddecoding processing units ex1001 and ex1002 are not necessarilyspecialized for the processing according to the aspect of the presentdisclosure and the processing of the conventional standard,respectively, and may be the ones capable of implementing generalprocessing. Furthermore, the configuration of the present embodiment canbe implemented by the LSI ex500.

As such, reducing the scale of the circuit of an LSI and reducing thecost are possible by sharing the decoding processing unit for theprocessing to be shared between the moving picture decoding methodaccording to the aspect of the present disclosure and the moving picturedecoding method in conformity with the conventional standard.

INDUSTRIAL APPLICABILITY

The present disclosure can be applied to an image coding method, animage decoding method, an image coding apparatus, and an image decodingmethod. In addition, the present disclosure can be used forhigh-resolution information display devices and image-capturing deviceswhich include image coding apparatuses, such as a television, a digitalvideo recorder, a car navigation system, a cellular phone, a digitalstill camera, and a digital video camera.

The invention claimed is:
 1. An image decoding method for decoding abitstream including a coded signal resulting from coding tiles andslices into which an image is partitioned, the method comprising:obtaining, from the bitstream, a restriction indicator indicating thatpartitioning of a picture is restricted; and decoding the coded signalbased on the restriction indicator, wherein each of the slices is eithera normal slice having, in a header, information used for an other sliceor a dependent slice which is decoded using information included in aslice header of another slice, when the normal slice starts from aposition other than a beginning of a first tile, a second tile codednext to the first tile does not start from the dependent slice, and eachof the tiles is subdivided into an integer number of slices.